See: Description
| Interface | Description |
|---|---|
| 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 | Description |
|---|---|
| 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.
|
| DistanceStatistics |
Statistics relating to vertex-vertex distances in a graph.
|
| UnweightedShortestPath<V,E> |
Computes the shortest path distances for graphs whose edges are not weighted (using BFS).
|
Copyright © 2021, 2022 Herve Girod. All Rights Reserved. Documentation and source under the BSD 3-Clause licence