helix.graph.algo
Class Warshall
java.lang.Object
helix.graph.algo.Warshall
public class Warshall
- extends Object
Method Summary |
int |
distance(Vertex u,
Vertex v)
get shortest path between vertex u and v |
void |
run()
main Warshall algorithm
get all distances between all pairs of vertices
TODO connected by given color -> add constraint |
Warshall
public Warshall(Graph graph)
- constructor
run
public void run()
- main Warshall algorithm
get all distances between all pairs of vertices
TODO connected by given color -> add constraint
distance
public int distance(Vertex u,
Vertex v)
- get shortest path between vertex u and v