úÎ78!          The unit partition of a range. Is the partition discrete ? =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. +Returns vertices fixes in the given orbits !degree of a cell wrt a node "An order-insensitive hash #An order-sensitive hash An indicator function.  lambdac must be insensitive to automorphisms relabeling of the graph for the Automorphism module to work. !A partition is its list of cells /A cell is represented by its list of vertices, , with the invariant that the list is sorted   &Fixed vertices of a given permutation (Builds the permutation taking l1 on l2. $Relabel a graph using a permutation $%Returns the graph of the permutation 4Returns the orbits of a permutation, as a partition %.Returns a permutation whose orbits are given. %Merge the orbits of two permutations 3A permutations maps a range of Vertices to itself. &All paths from root to leaves RReturns a canonic labeling of the graph (slow -- but dead simple implementation). B This implementation serves documentation and debugging purposes. UGiven a graph, return generators of its automorphism group, and its canonic labeling 'Return the canonic version of a graph. (Tells whether two graphs are isomorphic -Returns generators of the automorphism group   '      !"#$%&'()*+, hgal-1.0.2Data.Graph.ConstructionData.Graph.PartitionData.Graph.PermutationData.Graph.AutomorphismprismGhCubeGkGcycleGstarGcliqueGunionGtensorGundirGproductG isSingleton unitPartition isDiscreterefinemcr fixedInOrbitslambdalambda_ Indicator PartitionCellfixed permBetween applyPermorbitsFromPerm mergePerms Permutation debugTree canonicGraph0 automorphisms canonicGraph isIsomorphic autGeneratorsdegreeCellVertexoihosh permAsGraphpermFromOrbitspaths