Math.Combinatorics.GraphAuts
- graphAuts :: Ord a => Graph a -> [Permutation a]
Documentation
graphAuts :: Ord a => Graph a -> [Permutation a]Source
Given a graph g, graphAuts g returns a strong generating set for the automorphism group of g.
HaskellForMaths-0.1.7
Math.Combinatorics.GraphAuts
graphAuts :: Ord a => Graph a -> [Permutation a]Source
Given a graph g, graphAuts g returns a strong generating set for the automorphism group of g.