| Package | Description |
|---|---|
| cusack.hcg.games.pebble.algorithms | |
| cusack.hcg.games.pebble.algorithms.matrixconversion | |
| cusack.hcg.games.pebble.algorithms.solvability.nondeterministic | |
| cusack.hcg.graph |
Contains classes that are directly related to storing graph data.
|
| Modifier and Type | Class and Description |
|---|---|
class |
EfficientPebbleGraph
An efficient data structure to hold graph (superclass) and pebbling information.
|
| Modifier and Type | Method and Description |
|---|---|
static EfficientListGraph |
UtilityMethodsForG6Graphs.convertStringToAdjacencyListGraph(java.lang.String toConvert)
Convert a string of the following format into an EfficientListGraph: 0 : 8; 1 : 8; 2 : 8; 3 : 8; 4 : 8; 5 : 8; 6
: 8; 7 : 8; 8 : 0 1 2 3 4 5 6 7;
|
| Modifier and Type | Method and Description |
|---|---|
static java.util.List<EfficientListGraph> |
UtilityMethodsForG6Graphs.readListFile(java.lang.String pathToFile) |
| Constructor and Description |
|---|
WeightedDistanceMatrix(EfficientListGraph graph) |
| Modifier and Type | Method and Description |
|---|---|
EfficientListGraph |
DrawableProblem.efficientListGraphFromString(java.lang.String s) |
| Constructor and Description |
|---|
DistanceMatrix(EfficientListGraph graph) |
EfficientListGraph(EfficientListGraph g) |