edu.uci.ics.jung.algorithms.shortestpath
Class DijkstraDistance.SourceData

java.lang.Object
  edu.uci.ics.jung.algorithms.shortestpath.DijkstraDistance.SourceData

Direct Known Subclasses:

DijkstraShortestPath.SourcePathData

Enclosing class:

DijkstraDistance<V,E>

protected class DijkstraDistance.SourceData
extends Object

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 estimated distance) of the vertices for which distances are unknown.

Author:

Joshua O'Madadhain

Field Summary

protected double	dist_reached
protected LinkedHashMap<V,Number>	distances
protected Map<V,Number>	estimatedDistances
protected boolean	reached_max
protected MapBinaryHeap<V>	unknownVertices

Constructor Summary

protected

DijkstraDistance.SourceData(V source)

Method Summary

protected void	createRecord(V w, E e, double new_dist)
protected Map.Entry<V,Number>	getNextVertex()
protected void	update(V dest, E tentative_edge, double new_dist)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Field Detail

distances

protected LinkedHashMap<V,Number> distances

estimatedDistances

protected Map<V,Number> estimatedDistances

unknownVertices

protected MapBinaryHeap<V> unknownVertices

reached_max

protected boolean reached_max

dist_reached

protected double dist_reached

Constructor Detail

DijkstraDistance.SourceData

protected DijkstraDistance.SourceData(V source)

Method Detail

getNextVertex

protected Map.Entry<V,Number> getNextVertex()

update

protected void update(V dest,
                      E tentative_edge,
                      double new_dist)

createRecord

protected void createRecord(V w,
                            E e,
                            double new_dist)