| Class | Description |
|---|---|
| DegreeSequence |
an UN-ORDERED list of the degrees from a graph (presumably).
|
| GeneralizedMultiCoveringAlgorithm |
Find MultiPackings of graphs.
|
| MultiCoveringAlgorithm |
Find MultiPackings of graphs.
|
| MultiDecompositionAlgorithm |
Find MultiDesigns of graphs.
|
| MultiDesignAlgorithm |
Find MultiDesigns of graphs.
|
| MultiGraphAdjacencyMatrix |
A multigraph implemented as an adjacency matrix.
|
| MultiPackingAlgorithm |
Find MultiPackings of graphs.
|
| NumberPartitioner |
Given an array of sizes and a target number, provide a list of all possible ways of adding zero or more copies of
each number together to reach the target.
|
| OriginalSubGraphRPermuter |
Create all r-permutations of a graph given a set of $n>r$ vertex labels.
|
| PossibleSubGraphVertexSubsets |
Determime which subsets of vertices might be O.K.
|
| SimpleEdge |
A class to represent an edge.
|
| SubGraph |
This implementation assumes an undirected graph.
|
| SubGraphRPermuter |
Create all r-permutations of a graph given a set of $n>r$ vertex labels.
|
| SubGraphRPermuterVersion2 |
Create all r-permutations of a graph given a set of $n>r$ vertex labels.
|
| UniqueSubGraphLabelings |
Iterates through all orderings of the vertices of the SubGraph and creates an
ArrayList of SubGraphs with each ordering that results in a different labeling
of the graph.
|