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

Packages that use DijkstraDistance.SourceData

edu.uci.ics.jung.algorithms.shortestpath

Provides a set of algorithms for computing the shortest path between two nodes or between each pair of nodes in a graph.

Uses of DijkstraDistance.SourceData in edu.uci.ics.jung.algorithms.shortestpath

Subclasses of DijkstraDistance.SourceData in edu.uci.ics.jung.algorithms.shortestpath

protected class

DijkstraShortestPath.SourcePathData 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.

Methods in edu.uci.ics.jung.algorithms.shortestpath that return DijkstraDistance.SourceData

protected DijkstraDistance.SourceData	DijkstraDistance.getSourceData(ArchetypeVertex source)
protected DijkstraDistance.SourceData	DijkstraShortestPath.getSourceData(ArchetypeVertex source)