| Class | Description |
|---|---|
| IsSolvableShortestPath | |
| IsSolvableShortestPebblePath | |
| PebbleDistanceMatrix |
A non-deterministic algorithm than sometimes returns SOLVABLE very quickly, and other times returns UNKNOWN.
|
| WeightedDistanceMatrix |
Assumes the graph is connected See Hurlbert's "Linear Optimization Technique for Graph Pebbling" First index in
weighMatrix is the root, second is vertex.
|
| WeightFunctionCheck |
Assumes the graph is connected.
|