hgal-2.0.0.2: library for computation automorphism group and canonical labelling of a graph

Safe HaskellSafe
LanguageHaskell98

Data.Graph.Partition

Description

 

Synopsis

Documentation

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. refine gr p q refines p wrt. q in gr.

isSingleton :: [a] -> Bool #

unitPartition :: (Vertex, Vertex) -> Partition #

The unit partition of a range.

isDiscrete :: Partition -> Bool #

Is the partition discrete ?

lambda :: Graph -> Partition -> Indicator #

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

fixedInOrbits :: Partition -> [Vertex] #

Returns vertices fixes in the given orbits