A | |
| AMap [Construction.Compute] | |
| ArrayB [Tools] | |
| Automate |
Automates
|
C | |
| CaseB [Tools] | |
| Compute [Construction] | |
| Compute [Monoid] |
Calculs divers.
|
| Construction | |
D | |
| Descriptor [Tools] | |
L | |
| ListB [Tools] | |
M | |
| MMap [Construction.Compute] | |
| Make [Relation] | |
| Make [UnionFind] | |
| MakeUF [Tools] | |
| Map [UnionFind.Item] | |
| Monoid |
Monoides
|
O | |
| OptionB [Tools] | |
P | |
| Pair2B [Tools] | |
| PairB [Tools] | |
R | |
| Regexp |
Expressions Régulières
|
| Rel [Construction.Compute] | |
| Relation | |
T | |
| ToItem [Tools] | |
| Tools | |
U | |
| UnionFind |
This module offers a purely functional implementation of Tarjan's
data structure for solving the union-find problem.
|