Safe Haskell | Safe-Inferred |
---|---|

Language | Haskell2010 |

## Synopsis

- type Cell = [Vertex]
- type Partition = [Cell]
- refine :: Graph -> Partition -> Partition -> Partition
- isSingleton :: [a] -> Bool
- unitPartition :: (Vertex, Vertex) -> Partition
- isDiscrete :: Partition -> Bool
- mcr :: Partition -> [Vertex]
- type Indicator = Int32
- lambda :: Graph -> Partition -> Indicator
- lambda_ :: Graph -> [Partition] -> [Indicator]
- fixedInOrbits :: Partition -> [Vertex]

# Documentation

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

refine :: Graph -> Partition -> Partition -> Partition Source #

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 Source #

isDiscrete :: Partition -> Bool Source #

Is the partition discrete ?

lambda :: Graph -> Partition -> Indicator Source #

An indicator function.
`lambda`

must be insensitive to automorphisms relabeling of the graph for the Automorphism module to work.

fixedInOrbits :: Partition -> [Vertex] Source #

Returns vertices fixes in the given orbits