hgal-2.0.0.3: library for computation automorphism group and canonical labelling of a graph
Quick Jump
Contents
Index
Index
applyPerm
Data.Graph.Permutation
arcG
Data.Graph.Construction
autGenerators
Data.Graph.Automorphism
automorphisms
Data.Graph.Automorphism
canonicGraph
Data.Graph.Automorphism
canonicGraph0
Data.Graph.Automorphism
Cell
Data.Graph.Partition
cliqueG
Data.Graph.Construction
cycleG
Data.Graph.Construction
debugTree
Data.Graph.Automorphism
emptyG
Data.Graph.Construction
fixed
Data.Graph.Permutation
fixedInOrbits
Data.Graph.Partition
hCubeG
Data.Graph.Construction
Indicator
Data.Graph.Partition
isDiscrete
Data.Graph.Partition
isIsomorphic
Data.Graph.Automorphism
isSingleton
Data.Graph.Partition
kG
Data.Graph.Construction
lambda
Data.Graph.Partition
lambda_
Data.Graph.Partition
linearG
Data.Graph.Construction
mcr
Data.Graph.Partition
mergePerms
Data.Graph.Permutation
orbitsFromPerm
Data.Graph.Permutation
Partition
Data.Graph.Partition
permBetween
Data.Graph.Permutation
Permutation
Data.Graph.Permutation
prismG
Data.Graph.Construction
productG
Data.Graph.Construction
refine
Data.Graph.Partition
starG
Data.Graph.Construction
tensorG
Data.Graph.Construction
undirG
Data.Graph.Construction
unionG
Data.Graph.Construction
unitPartition
Data.Graph.Partition
withUnitPartition
Data.Graph.Automorphism