hegyi [Mon, 07 Feb 2005 17:35:25 +0000] rev 1141
This is not ready yet, but I have to go home...
deba [Mon, 07 Feb 2005 15:40:53 +0000] rev 1140
Removing from work.
deba [Mon, 07 Feb 2005 15:40:34 +0000] rev 1139
Changing first to iterators.
alpar [Mon, 07 Feb 2005 12:31:30 +0000] rev 1138
Fix wrong reference in the documentation.
deba [Mon, 07 Feb 2005 11:29:25 +0000] rev 1137
IO moved to lemon.
deba [Mon, 07 Feb 2005 11:28:37 +0000] rev 1136
Graph documentation
deba [Mon, 07 Feb 2005 10:50:05 +0000] rev 1135
Removing graph_defines.h
deba [Mon, 07 Feb 2005 10:49:44 +0000] rev 1134
Documentation
deba [Mon, 07 Feb 2005 10:48:14 +0000] rev 1133
Documentation
alpar [Sun, 06 Feb 2005 20:14:30 +0000] rev 1132
Revised dijkstra.h with several new features added.
alpar [Sun, 06 Feb 2005 20:08:25 +0000] rev 1131
The new dijkstra.h comes in the next commit.
alpar [Sun, 06 Feb 2005 20:00:56 +0000] rev 1130
- PredNodeMap is a NullMap by default
- Execution with stop condition
- Find shortest path between two nodes
alpar [Sun, 06 Feb 2005 15:49:37 +0000] rev 1129
error.h added
alpar [Sun, 06 Feb 2005 14:44:41 +0000] rev 1128
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.