Safe Haskell | Safe-Infered |
---|

- data Digraph a = DG [a] [(a, a)]
- cayleyDigraphP :: (Num a, Ord 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 :: (Enum t, Num t, Ord t, Show t) => Permutation t -> [SGen]
- inversions :: (Enum t, Num t, Ord t) => Permutation t -> [(t, t)]

# Documentation

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

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

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 IntSource

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

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

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