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, shortestPathequals, getClass, hashCode, notify, notifyAll, toString, wait, wait, waitgetLinkCostCalculators, getLinkLevelSelector, getNodeCostCalculators, setInitialAnalysisInfo, setLinkCostCalculators, setLinkLevelSelector, setNetworkAnalyst, setNodeCostCalculators, shortestPathpublic BidirectionalDijkstra(NetworkExplorer ne, LinkCostCalculator[] lccs, NodeCostCalculator[] nccs, LinkLevelSelector forwardLinkLevelSelector, LinkLevelSelector backwardLinkLevelSelector)
public ShortestPath clone()
clone in interface ShortestPathclone in class BidirectionalBfs