| Package | Description |
|---|---|
| graph.symmetry.nauty |
Classes needed to implement McKay's graph labeling algorithm.
|
| Modifier and Type | Method and Description |
|---|---|
SearchTreeNode<V> |
SearchTreeNode.getParent() |
SearchTreeNode<V> |
SearchTree.getRoot() |
| Modifier and Type | Method and Description |
|---|---|
java.util.List<SearchTreeNode<V>> |
SearchTreeNode.getChildren() |
java.util.List<SearchTreeNode<V>> |
SearchTree.getTerminalNodes()
Finds all terminal nodes
|
| Modifier and Type | Method and Description |
|---|---|
void |
SearchTree.setRoot(SearchTreeNode<V> root) |
| Constructor and Description |
|---|
SearchTreeNode(OrderedPartition<V> nodePartition,
V split,
SearchTreeNode<V> parent)
Creates a node of the search tree given its partition, a vertex that splits it and its parent
|