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

java.lang.Object
  extended by 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
 double dist_reached
           
 LinkedHashMap<V,Number> distances
           
 Map<V,Number> estimatedDistances
           
 boolean reached_max
           
 MapBinaryHeap<V> unknownVertices
           
 
Constructor Summary
DijkstraDistance.SourceData(V source)
           
 
Method Summary
 void createRecord(V w, E e, double new_dist)
           
 Map.Entry<V,Number> getNextVertex()
           
 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

public LinkedHashMap<V,Number> distances

estimatedDistances

public Map<V,Number> estimatedDistances

unknownVertices

public MapBinaryHeap<V> unknownVertices

reached_max

public boolean reached_max

dist_reached

public double dist_reached
Constructor Detail

DijkstraDistance.SourceData

public DijkstraDistance.SourceData(V source)
Method Detail

getNextVertex

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

update

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

createRecord

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


Copyright © 2008 null. All Rights Reserved.