Package org.jgrapht.alg
Class BidirectionalDijkstraShortestPath.AlgorithmDetails
- java.lang.Object
-
- org.jgrapht.alg.BidirectionalDijkstraShortestPath.AlgorithmDetails
-
- Enclosing class:
- BidirectionalDijkstraShortestPath<V,E>
class BidirectionalDijkstraShortestPath.AlgorithmDetails extends java.lang.Object
The implementation details
-
-
Nested Class Summary
Nested Classes Modifier and Type Class Description (package private) class
BidirectionalDijkstraShortestPath.AlgorithmDetails.DirectedSpecifics
(package private) class
BidirectionalDijkstraShortestPath.AlgorithmDetails.QueueEntry
(package private) class
BidirectionalDijkstraShortestPath.AlgorithmDetails.SearchFrontier
Helper class to maintain the search frontier(package private) class
BidirectionalDijkstraShortestPath.AlgorithmDetails.Specifics
(package private) class
BidirectionalDijkstraShortestPath.AlgorithmDetails.UndirectedSpecifics
-
Field Summary
Fields Modifier and Type Field Description private BidirectionalDijkstraShortestPath.AlgorithmDetails.SearchFrontier
backwardFrontier
private BidirectionalDijkstraShortestPath.AlgorithmDetails.SearchFrontier
forwardFrontier
private double
radius
private V
source
private V
target
-
Method Summary
All Methods Instance Methods Concrete Methods Modifier and Type Method Description private GraphPath<V,E>
createPath(double weight, V commonVertex)
GraphPath<V,E>
run()
-
-
-
Field Detail
-
forwardFrontier
private final BidirectionalDijkstraShortestPath.AlgorithmDetails.SearchFrontier forwardFrontier
-
backwardFrontier
private final BidirectionalDijkstraShortestPath.AlgorithmDetails.SearchFrontier backwardFrontier
-
source
private final V source
-
target
private final V target
-
radius
private final double radius
-
-