, including all inherited members.
| _graph (defined in Dijkstra) | Dijkstra | [protected] |
| _openNodeQueue (defined in Dijkstra) | Dijkstra | [protected] |
| _stopDijkstra (defined in Dijkstra) | Dijkstra | [protected] |
| atStartOfDijkstra()=0 (defined in Dijkstra) | Dijkstra | [pure virtual] |
| computeShortestPath(int startId, int endId) (defined in Dijkstra) | Dijkstra | |
| computeShortestPath(int startId, int endId, bool checkNodes, bool checkEdges, bool rememberEdges, bool forward) (defined in Dijkstra) | Dijkstra | |
| computeShortestPath(int startId, int endId, bool reconstructPath)=0 (defined in Dijkstra) | Dijkstra | [pure virtual] |
| computeShortestPathToAll(int startId, bool checkNodes, bool checkEdges, bool rememberEdges, bool forward) (defined in Dijkstra) | Dijkstra | |
| Dijkstra(Graph *roadNetwork, DistanceHeuristic *heuristic) (defined in Dijkstra) | Dijkstra | |
| doPrecomputation()=0 (defined in Dijkstra) | Dijkstra | [pure virtual] |
| edgeAllowed(bool outEdge, int nodeId, int edgeId)=0 (defined in Dijkstra) | Dijkstra | [pure virtual] |
| expanded (defined in Dijkstra) | Dijkstra | [protected] |
| expandedFrom (defined in Dijkstra) | Dijkstra | [protected] |
| exploredNodes (defined in Dijkstra) | Dijkstra | |
| heuristic (defined in Dijkstra) | Dijkstra | [protected] |
| heuristicValues (defined in Dijkstra) | Dijkstra | [protected] |
| nodeAllowed(int nodeId)=0 (defined in Dijkstra) | Dijkstra | [pure virtual] |
| reconstructShortestPath(int startId, int endId)=0 (defined in Dijkstra) | Dijkstra | [protected, pure virtual] |
| resetAll() (defined in Dijkstra) | Dijkstra | |
| resetNode(int nodeId)=0 (defined in Dijkstra) | Dijkstra | [pure virtual] |
| setHeuristic(DistanceHeuristic *heuristic) (defined in Dijkstra) | Dijkstra | |
| shortestPath (defined in Dijkstra) | Dijkstra | |
| timesFromStart (defined in Dijkstra) | Dijkstra | [protected] |
| weights (defined in Dijkstra) | Dijkstra | [protected] |
| ~Dijkstra() (defined in Dijkstra) | Dijkstra | [virtual] |
1.7.1
