edu.uci.ics.jung.algorithms.shortestpath
Class DijkstraShortestPath.SourcePathData
java.lang.Object
edu.uci.ics.jung.algorithms.shortestpath.DijkstraDistance.SourceData
edu.uci.ics.jung.algorithms.shortestpath.DijkstraShortestPath.SourcePathData
- Enclosing class:
- DijkstraShortestPath<V,E>
protected class DijkstraShortestPath.SourcePathData
- extends DijkstraDistance.SourceData
For a given source vertex, holds the estimated and final distances,
tentative and final assignments of incoming edges on the shortest path from
the source vertex, and a priority queue (ordered by estimaed distance)
of the vertices for which distances are unknown.
- Author:
- Joshua O'Madadhain
Methods inherited from class java.lang.Object |
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
tentativeIncomingEdges
protected Map<V,E> tentativeIncomingEdges
incomingEdges
protected LinkedHashMap<V,E> incomingEdges
DijkstraShortestPath.SourcePathData
protected DijkstraShortestPath.SourcePathData(V source)
update
public void update(V dest,
E tentative_edge,
double new_dist)
- Overrides:
update
in class DijkstraDistance.SourceData
getNextVertex
public Map.Entry<V,Number> getNextVertex()
- Overrides:
getNextVertex
in class DijkstraDistance.SourceData
createRecord
public void createRecord(V w,
E e,
double new_dist)
- Overrides:
createRecord
in class DijkstraDistance.SourceData
Copyright © 2009. All Rights Reserved.