


Description 


Synopsis 



Documentation 


A cell is represented by its list of vertices,
with the invariant that the list is sorted



A partition is its list of cells



Refines a Partition wrt to another Partition, given a graph.
(explained on pages 5052)
This is equivalent to partition the graph's DFA in equivalent states.





The unit partition of a range.



Is the partition discrete ?







An indicator function.
lambda must be insensitive to automorphisms relabeling of the graph for the Automorphism module to work.





Returns vertices fixes in the given orbits


Produced by Haddock version 2.3.0 