Module org.jgrapht.core
Package org.jgrapht.alg.shortestpath
Class BaseBidirectionalShortestPathAlgorithm.BaseSearchFrontier<V,E>
- java.lang.Object
-
- org.jgrapht.alg.shortestpath.BaseBidirectionalShortestPathAlgorithm.BaseSearchFrontier<V,E>
-
- Type Parameters:
V
- vertices typeE
- edges type
- Direct Known Subclasses:
BidirectionalAStarShortestPath.AStarSearchFrontier
,BidirectionalDijkstraShortestPath.DijkstraSearchFrontier
- Enclosing class:
- BaseBidirectionalShortestPathAlgorithm<V,E>
abstract static class BaseBidirectionalShortestPathAlgorithm.BaseSearchFrontier<V,E> extends java.lang.Object
Base class of the search frontier used by bidirectional shortest path algorithms.
-
-
Constructor Summary
Constructors Constructor Description BaseSearchFrontier(Graph<V,E> graph)
Constructs instance for a givengraph
.
-
Method Summary
All Methods Instance Methods Abstract Methods Modifier and Type Method Description (package private) abstract double
getDistance(V v)
Returns distance to vertexv
computed so far.(package private) abstract E
getTreeEdge(V v)
Returns edge which connectsv
to its predecessor in the shortest paths tree of this frontier.
-
-
-
Method Detail
-
getDistance
abstract double getDistance(V v)
Returns distance to vertexv
computed so far.- Parameters:
v
- vertex- Returns:
- distance to
v
-
-