Safe Haskell	Safe-Inferred
Language	Haskell2010

Data.Graph.Partition

Description

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

type Cell = [Vertex] Source #

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

type Partition = [Cell] Source #

A partition is its list of cells

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 #

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

The unit partition of a range.

isDiscrete :: Partition -> Bool Source #

Is the partition discrete ?

mcr :: Partition -> [Vertex] Source #

type Indicator = Int32 Source #

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

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

lambda_ :: Graph -> [Partition] -> [Indicator] Source #

fixedInOrbits :: Partition -> [Vertex] Source #

Returns vertices fixes in the given orbits