- Timestamp:
- 07/20/12 18:58:28 (13 years ago)
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
TabularUnified branches/RoutePlanning/HeuristicLab.Algorithms.GraphRouting/3.3/DijkstraAlgorithm.cs ΒΆ
r8312 r8314 97 97 } 98 98 route.Add(current); 99 while ( !predecessors.TryGetValue(current, out next)) {99 while (predecessors.TryGetValue(current, out next)) { 100 100 current = predecessors[current]; 101 101 route.Add(current);
Note: See TracChangeset
for help on using the changeset viewer.