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.

 hier: hierarchygraph.h hierarchygraph_test.cc

 	g++ -Wall -W -I../.. -I../klao -I../../lemon hierarchygraph_test.cc -o test

 edge: edgepathgraph_test.cc edgepathgraph.h

 	g++ -Wall -W -I../.. -I../klao -I../../lemon edgepathgraph_test.cc -o test