|
||||||||||
| PREV PACKAGE NEXT PACKAGE | FRAMES NO FRAMES | |||||||||
See:
Description
| Interface Summary | |
|---|---|
| Distance<V> | An interface for classes which calculate the distance between one vertex and another. |
| ShortestPath<V,E> | An interface for algorithms that calculate shortest paths. |
| Class Summary | |
|---|---|
| BFSDistanceLabeler<V,E> | Labels each node in the graph according to the BFS distance from the start node(s). |
| DijkstraDistance<V,E> | Calculates distances in a specified graph, using Dijkstra's single-source-shortest-path algorithm. |
| DijkstraDistance.VertexComparator<V> | Compares according to distances, so that the BinaryHeap knows how to order the tree. |
| DijkstraShortestPath<V,E> | Calculates distances and shortest paths using Dijkstra's single-source-shortest-path algorithm. |
| DistanceStatistics | Statistics relating to vertex-vertex distances in a graph. |
| MinimumSpanningForest<V,E> | For the input Graph, creates a MinimumSpanningTree using a variation of Prim's algorithm. |
| MinimumSpanningForest2<V,E> | For the input Graph, creates a MinimumSpanningTree using a variation of Prim's algorithm. |
| PrimMinimumSpanningTree<V,E> | For the input Graph, creates a MinimumSpanningTree using a variation of Prim's algorithm. |
| ShortestPathUtils | Utilities relating to the shortest paths in a graph. |
| UnweightedShortestPath<V,E> | Computes the shortest path distances for graphs whose edges are not weighted (using BFS). |
Provides interfaces and classes for calculating (geodesic) distances and shortest paths. Currently includes:
DijkstraDistance: finds the distances from a specified source vertex to other vertices in a
weighted graph with no negative cycles
DijkstraShortestPath: extends DijkstraDistance, also finds shortest paths
Distance: an interface for defining vertex-vertex distances
PrimMinimumSpanningTree: identifies the spanning tree for a graph of least total edge weight
ShortestPath: an interface for shortest-path algorithms
ShortestPathUtils: utility functions for manipulating shortest paths
UnweightedShortestPath: finds the distances from a specified source vertex to other vertices in an
unweighted graph
|
||||||||||
| PREV PACKAGE NEXT PACKAGE | FRAMES NO FRAMES | |||||||||