DijkstraRouterTT Class Reference
#include <DijkstraRouterTT.h>
Detailed Description
Computes the shortest path through a network using the Dijkstra algorithm.
The template parameters are:
- Parameters:
-
| E | The edge class to use (MSEdge/ROEdge) |
| V | The vehicle class to use (MSVehicle/ROVehicle) |
| PF | The prohibition function to use (prohibited_withRestrictions/prohibited_noRestrictions) |
| EC | The class to retrieve the effort for an edge from |
The router is edge-based. It must know the number of edges for internal reasons and whether a missing connection between two given edges (unbuild route) shall be reported as an error or as a warning.
The documentation for this class was generated from the following file:
