Changeset 8350 for branches/RoutePlanning/HeuristicLab.Problems.RoutePlanning.Test/Program.cs

Timestamp:

07/27/12 16:34:45 (12 years ago)

Author:

spimming

Message:

#1894:

• new implementation for priority queue
• based on heap data structure
• allow multiple keys
• adapted test program

File:

• branches/RoutePlanning/HeuristicLab.Problems.RoutePlanning.Test/Program.cs (modified) (1 diff)

branches/RoutePlanning/HeuristicLab.Problems.RoutePlanning.Test/Program.cs

@@ -37 +37 @@
       Console.WriteLine();
       Graph.Graph graph = new Graph.Graph(xmlDs);
-      IRouter router = new DijkstraAlgorithm(graph);
+      //IRouter router = new DijkstraAlgorithm(graph);
+      IRouter router = new AStarAlgorithm(graph);
       Console.Write("Calculate route ... ");
       sw = Stopwatch.StartNew();