|
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.Dijkstra<VertexType,EdgeType>
public class Dijkstra<VertexType extends BaseVertex,EdgeType extends BaseEdge<VertexType>>
This method finds the shortest path from a vertex to all vertices of a graph. [Should be tested]
Constructor Summary | |
---|---|
Dijkstra()
|
Method Summary | |
---|---|
void |
doAlgorithm()
|
java.util.Vector<VertexType> |
getShortestPath(BaseGraph<VertexType,EdgeType> graph,
VertexType vertex)
This method finds a reference array using Dijkstra algorithm from which, one can find the shortest paths of all vertices of a graph from an arbitrary given vertex. |
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 |
Methods inherited from interface graphlab.library.algorithms.AlgorithmInterface |
---|
acceptEventDispatcher |
Constructor Detail |
---|
public Dijkstra()
Method Detail |
---|
public java.util.Vector<VertexType> getShortestPath(BaseGraph<VertexType,EdgeType> graph, VertexType vertex) throws InvalidVertexException
graph
- Graph object to be searched.vertex
- The source of the paths.
InvalidVertexException
- if the supplied vertices are invalid.public void doAlgorithm()
doAlgorithm
in interface AutomatedAlgorithm
|
GraphLab Project | |||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |