| Safe Haskell | Safe-Inferred |
|---|---|
| Language | Haskell2010 |
Data.Graph.Permutation
Description
This modules manages permutations between nodes of a graph. Permutations are represented as arrays.
Synopsis
- 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
fixed :: Permutation -> [Vertex] Source #
Fixed vertices of a given permutation
permBetween :: Bounds -> [Vertex] -> [Vertex] -> Permutation Source #
Builds the permutation taking l1 on l2.
orbitsFromPerm :: Permutation -> Partition Source #
Returns the orbits of a permutation, as a partition
mergePerms :: Permutation -> Permutation -> Permutation Source #
Merge the orbits of two permutations