public class WeightedDistanceMatrix
extends DistanceMatrix
Assumes the graph is connected See Hurlbert's "Linear Optimization Technique for Graph Pebbling" First index in
weighMatrix is the root, second is vertex. Matrix stores the weight of a vertex coming from the root. Values are
calculated by calculating d, which is the max distance a vertex is from r. Then the weight of a vertex is
2^{d-distance(r,v)}. If the sum of the weights of a configuration of pebbles, where a pebble's weight is from the
weightMatrix, is less than the value of weightMatrix[r][r]=2^d, then the configuration is not r solvable. If it is
>=, we don't know if the graph is solvable or unsolvable.
- Author:
- mark.powers, 6/14/2017