Several important changes:
- Named parameters for setting ReachedMap
- run() is separated into initialization and processing phase
- It is possible to run Dijkstra from multiple sources
- It is possible to stop the execution when a destination is reached.

 /*!

 \page undir_graphs Undirected graph structures

 The primary data structures of LEMON are the graph classes.

 Under construction.

 */