|
GraphLab Project | |||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Objectgraphlab.library.algorithms.Algorithm
graphlab.library.algorithms.shortestpath.Johnson<VertexType,EdgeType,GraphType>
public class Johnson<VertexType extends BaseVertex,EdgeType extends BaseEdge<VertexType>,GraphType extends BaseGraph<VertexType,EdgeType>>
This Algorithm computes the lenght of the shortest path between any two arbitrary vertices. This method is usually used for sparse graphs.
Method Summary | |
---|---|
int[][] |
ComputePaths(GraphType g)
|
Methods inherited from class graphlab.library.algorithms.Algorithm |
---|
acceptEventDispatcher, dispatchEvent, getDispatcher |
Methods inherited from class java.lang.Object |
---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
Method Detail |
---|
public int[][] ComputePaths(GraphType g)
|
GraphLab Project | |||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |