SUMO - Simulation of Urban MObility
DijkstraRouterEffort Class Reference

Computes the shortest path through a network using the Dijkstra algorithm. More...

#include <DijkstraRouterEffort.h>


Detailed Description

Computes the shortest path through a network using the Dijkstra algorithm.

The template parameters are:

Parameters:
EThe edge class to use (MSEdge/ROEdge)
VThe vehicle class to use (MSVehicle/ROVehicle)
PFThe prohibition function to use (prohibited_withRestrictions/prohibited_noRestrictions)
ECThe 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:
 All Data Structures Files Functions Variables Typedefs Enumerations Enumerator Friends Defines