Math.Algebra.Group.CayleyGraph

Documentation

data Digraph a

Constructors

DG [a] [(a, a)]

Instances

Eq a => Eq (Digraph a)

Defined in Math.Algebra.Group.CayleyGraph

Methods

(==) :: Digraph a -> Digraph a -> Bool

(/=) :: Digraph a -> Digraph a -> Bool

Ord a => Ord (Digraph a)

Defined in Math.Algebra.Group.CayleyGraph

Methods

compare :: Digraph a -> Digraph a -> Ordering

(<) :: Digraph a -> Digraph a -> Bool

(<=) :: Digraph a -> Digraph a -> Bool

(>) :: Digraph a -> Digraph a -> Bool

(>=) :: Digraph a -> Digraph a -> Bool

max :: Digraph a -> Digraph a -> Digraph a

min :: Digraph a -> Digraph a -> Digraph a

Show a => Show (Digraph a)

Defined in Math.Algebra.Group.CayleyGraph

Methods

showsPrec :: Int -> Digraph a -> ShowS

show :: Digraph a -> String

showList :: [Digraph a] -> ShowS

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

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

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

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

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

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

fromTranspositions :: [SGen] -> Permutation Int

fromTrans :: [SGen] -> [Int]

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

toTrans :: Ord a => [a] -> [SGen]

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

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