Safe Haskell | None |
---|---|

Language | Haskell98 |

- data Digraph a = DG [a] [(a, a)]
- cayleyDigraphP :: (Ord a, Num a) => [a] -> Digraph a
- cayleyGraphP :: (Ord a, Show a) => [Permutation a] -> Graph (Permutation a)
- cayleyDigraphS :: Ord a => ([a], [([a], [a])]) -> Digraph [a]
- cayleyGraphS :: Ord a => ([a], [([a], [a])]) -> Graph [a]
- fromTranspositions :: [SGen] -> Permutation Int
- fromTrans :: [SGen] -> [Int]
- bubblesort :: Ord a => [a] -> [a]
- toTrans :: Ord t => [t] -> [SGen]
- toTranspositions :: (Ord t, Num t, Enum t) => Permutation t -> [SGen]
- inversions :: (Ord t, Num t, Enum t) => Permutation t -> [(t, t)]

# Documentation

DG [a] [(a, a)] |

cayleyDigraphP :: (Ord a, Num a) => [a] -> Digraph a Source

cayleyGraphP :: (Ord a, Show a) => [Permutation a] -> Graph (Permutation a) Source

The Cayley graph (undirected) on the generators (and their inverses), for a group given as permutations

cayleyDigraphS :: Ord a => ([a], [([a], [a])]) -> Digraph [a] Source

cayleyGraphS :: Ord a => ([a], [([a], [a])]) -> Graph [a] Source

The Cayley graph (undirected) on the generators (and their inverses), for a group given as generators and relations

fromTranspositions :: [SGen] -> Permutation Int Source

bubblesort :: Ord a => [a] -> [a] Source

toTranspositions :: (Ord t, Num t, Enum t) => Permutation t -> [SGen] Source

inversions :: (Ord t, Num t, Enum t) => Permutation t -> [(t, t)] Source