SUMO - Simulation of Urban MObility
DijkstraRouterEffort.h File Reference
#include <config.h>
#include <cassert>
#include <string>
#include <functional>
#include <vector>
#include <set>
#include <limits>
#include <algorithm>
#include <utils/common/MsgHandler.h>
#include <utils/common/StdDefs.h>
#include "SUMOAbstractRouter.h"
Include dependency graph for DijkstraRouterEffort.h:
This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Data Structures

class  DijkstraRouterEffort< E, V, PF >
 Computes the shortest path through a network using the Dijkstra algorithm. More...
 
struct  DijkstraRouterEffort< E, V, PF >::EdgeInfo
 
class  DijkstraRouterEffort< E, V, PF >::EdgeInfoByEffortComparator
 

Detailed Description

Author
Daniel Krajzewicz
Jakob Erdmann
Michael Behrisch
Date
Mon, 25 July 2005
Version
Id
DijkstraRouterEffort.h 20433 2016-04-13 08:00:14Z behrisch

Definition in file DijkstraRouterEffort.h.