public class BidirectionalDijkstra extends BidirectionalBfs implements ShortestPath
Constructor and Description |
---|
BidirectionalDijkstra(Dijkstra forwardSearch, Dijkstra backwardSearch) |
BidirectionalDijkstra(NetworkExplorer ne, LinkCostCalculator[] lccs, NodeCostCalculator[] nccs, LinkLevelSelector forwardLinkLevelSelector, LinkLevelSelector backwardLinkLevelSelector) |
Modifier and Type | Method and Description |
---|---|
ShortestPath |
clone() |
getLinkCostCalculators, getLinkLevelSelector, getNodeCostCalculators, setInitialAnalysisInfo, setLinkCostCalculators, setLinkLevelSelector, setNetworkAnalyst, setNodeCostCalculators, shortestPath
equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
getLinkCostCalculators, getLinkLevelSelector, getNodeCostCalculators, setInitialAnalysisInfo, setLinkCostCalculators, setLinkLevelSelector, setNetworkAnalyst, setNodeCostCalculators, shortestPath
public BidirectionalDijkstra(NetworkExplorer ne, LinkCostCalculator[] lccs, NodeCostCalculator[] nccs, LinkLevelSelector forwardLinkLevelSelector, LinkLevelSelector backwardLinkLevelSelector)
public ShortestPath clone()
clone
in interface ShortestPath
clone
in class BidirectionalBfs