DijkstraRouter.h File Reference

#include <config.h>
#include <cassert>
#include <string>
#include <functional>
#include <vector>
#include <set>
#include <limits>
#include <algorithm>
#include <iterator>
#include <utils/common/ToString.h>
#include <utils/common/MsgHandler.h>
#include <utils/common/StdDefs.h>
#include "EffortCalculator.h"
#include "SUMOAbstractRouter.h"

Include dependency graph for DijkstraRouter.h:

This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Data Structures
class	DijkstraRouter< E, V >
	Computes the shortest path through a network using the Dijkstra algorithm. More...
class	DijkstraRouter< E, V >::EdgeInfoByEffortComparator

Macros
#define	DijkstraRouter_DEBUG_QUERY_VISITED_OUT   std::cerr

Detailed Description

Author

Daniel Krajzewicz

Jakob Erdmann

Michael Behrisch

Date

Mon, 25 July 2005

Definition in file DijkstraRouter.h.

Macro Definition Documentation

DijkstraRouter_DEBUG_QUERY_VISITED_OUT

#define DijkstraRouter_DEBUG_QUERY_VISITED_OUT   std::cerr

Definition at line 44 of file DijkstraRouter.h.