Safe Haskell | Safe |
---|---|
Language | Haskell98 |
Data.Graph.Permutation
Description
This modules manages permutations between nodes of a graph. Permutations are represented as arrays.
- type Permutation = Array Vertex Vertex
- fixed :: Permutation -> [Vertex]
- permBetween :: Bounds -> [Vertex] -> [Vertex] -> Permutation
- applyPerm :: Permutation -> Graph -> Graph
- orbitsFromPerm :: Permutation -> Partition
- mergePerms :: Permutation -> Permutation -> Permutation
Documentation
type Permutation = Array Vertex Vertex #
A permutations maps a range of Vertices to itself.
fixed :: Permutation -> [Vertex] #
Fixed vertices of a given permutation
permBetween :: Bounds -> [Vertex] -> [Vertex] -> Permutation #
Builds the permutation taking l1 on l2.
applyPerm :: Permutation -> Graph -> Graph #
Relabel a graph using a permutation
orbitsFromPerm :: Permutation -> Partition #
Returns the orbits of a permutation, as a partition
mergePerms :: Permutation -> Permutation -> Permutation #
Merge the orbits of two permutations