 | hgal-1.0.1: library for computation automorphism group and canonical labelling of a graph | Contents | Index |
|
|
|
|
|
| Description |
NOTE: Usage of implicit automorphisms, as described on page 62, is not implemented here.
TODO:
- as GHC 6.6, use Sequence instead of appends at end.
- skip first automorphism found; it is identity.
- try not relabeling the graphs
|
|
| Synopsis |
|
|
|
| Documentation |
|
| canonicGraph :: Graph -> Graph |
| Return the canonic version of a graph.
|
|
| canonicGraph0 :: Graph -> Graph |
| Returns a canonic labeling of the graph (slow -- but dead simple implementation).
This implementation serves documentation and debugging purposes.
|
|
| autGenerators :: Graph -> [Permutation] |
| Returns generators of the automorphism group
|
|
| automorphisms :: Graph -> ([Permutation], Graph) |
| Given a graph, return generators of its automorphism group, and its canonic labeling
|
|
| isIsomorphic :: Graph -> Graph -> Bool |
| Tells whether two graphs are isomorphic
|
|
| Produced by Haddock version 0.8 |