Changeset 8509 for branches/RoutePlanning/HeuristicLab.Algorithms.GraphRouting

Timestamp:

08/20/12 17:32:19 (13 years ago)

Author:

spimming

Message:

#1894:
Dijkstra: get node with a specific rank
graph interface extended: get vertices
fixed bug in ReadData method
methods to perform routing algorithm benchmark added to test program

File:

• branches/RoutePlanning/HeuristicLab.Algorithms.GraphRouting/3.3/DijkstraAlgorithmV2.cs (modified) (1 diff)

branches/RoutePlanning/HeuristicLab.Algorithms.GraphRouting/3.3/DijkstraAlgorithmV2.cs

@@ -53 +53 @@
 
     #endregion
+
+    public long GetNodeIdWithRank(long sourceNodeId, int rank) {
+      visitedNodes = new HashSet<long>();        // visited
+      unvisitedNodes = new HashSet<long>();      // unvisited
+      distances = new Dictionary<long, float>();
+      predecessors = new Dictionary<long, long>();
+      int currentRank = 0;
+
+
+      long currentNode = sourceNodeId;
+      distances.Add(currentNode, 0);
+      unvisitedNodes.Add(currentNode);
+
+      while (unvisitedNodes.Count > 0) {
+        currentNode = GetMinimumDistance(unvisitedNodes);
+        visitedNodes.Add(currentNode);
+        unvisitedNodes.Remove(currentNode);
+        currentRank++;
+        if (currentRank == rank) {
+          break;
+        }
+        FindMinimalWeight(currentNode);
+      }
+      return currentNode;
+    }
 
     private long GetMinimumDistance(HashSet<long> nodeIds) {