|hgal-1.0.1: library for computation automorphism group and canonical labelling of a graph||Contents||Index|
|type Cell = [Vertex]|
|A cell is represented by its list of vertices,
with the invariant that the list is sorted
|type Partition = [Cell]|
|A partition is its list of cells
|refine :: Graph -> Partition -> Partition -> Partition|
|Refines a Partition wrt to another Partition, given a graph.
(explained on pages 50-52)
This is equivalent to partition the graph's DFA in equivalent states.
|isSingleton :: [a] -> Bool|
|unitPartition :: (Vertex, Vertex) -> Partition|
|The unit partition of a range.
|isDiscrete :: Partition -> Bool|
|Is the partition discrete ?
|mcr :: Partition -> [Vertex]|
|type Indicator = Int32|
|lambda :: Graph -> Partition -> Indicator|
|An indicator function.
lambda must be insensitive to automorphisms relabeling of the graph for the Automorphism module to work.
|lambda_ :: Graph -> [Partition] -> [Indicator]|
|fixedInOrbits :: Partition -> [Vertex]|
|Returns vertices fixes in the given orbits
|Produced by Haddock version 0.8|