HaskellForMaths-0.4.8: Combinatorics, group theory, commutative algebra, non-commutative algebra

Safe HaskellNone
LanguageHaskell98

Math.Algebra.Group.CayleyGraph

Synopsis

Documentation

data Digraph a Source

Constructors

DG [a] [(a, a)] 

Instances

Eq a => Eq (Digraph a) 
Ord a => Ord (Digraph a) 
Show a => Show (Digraph 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

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

toTrans :: Ord t => [t] -> [SGen] Source

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