| Constructor and Description |
|---|
PermutationAnalyzator(Graph<V,E> graph)
Given a graph, finds its permutations and intializes the permutations list
|
| Modifier and Type | Method and Description |
|---|---|
java.util.List<PermutationGroup> |
findDihedralGroups()
Finds permutation's dihedral groups
|
java.util.List<PermutationGroup> |
findReflectionGroups()
Finds permutation's reflection groups
|
java.util.List<PermutationGroup> |
findRotationGroups()
Finds permutation's rotation groups
|
PermutationGroup |
isDehidralGroupGenerator(Permutation p1,
Permutation p2)
Checks if permutations form a dihedral group generator
|
PermutationGroup |
isReflectionGroupGenerator(Permutation p)
Checks if a permutation is reflection group generator
|
PermutationGroup |
isRotationalGroupGenerator(Permutation p)
Checks if a permutation is rotation group generator
|
public java.util.List<PermutationGroup> findReflectionGroups()
public PermutationGroup isReflectionGroupGenerator(Permutation p)
p - Permutationp is its generator, null otherwisepublic java.util.List<PermutationGroup> findRotationGroups()
public PermutationGroup isRotationalGroupGenerator(Permutation p)
p - Permutationp is its generator, null otherwisepublic java.util.List<PermutationGroup> findDihedralGroups()
public PermutationGroup isDehidralGroupGenerator(Permutation p1, Permutation p2)
p1 - The first permutationp2 - The second permtuationp1 and p2 are is generators, null otherwise