Changeset 8321

Timestamp:

07/24/12 17:41:24 (12 years ago)

Author:

spimming

Message:

#1894: initial version of astar algorithm

Location:

branches/RoutePlanning

Files:

• HeuristicLab.Algorithms.GraphRouting/3.3/AStarAlgorithm.cs (added)
• HeuristicLab.Algorithms.GraphRouting/3.3/HeuristicLab.Algorithms.GraphRouting.csproj (modified) (1 diff)
• HeuristicLab.Algorithms.GraphRouting/3.3/Pair.cs (added)
• HeuristicLab.Algorithms.GraphRouting/3.3/PriorityQueue.cs (added)
• HeuristicLab.Problems.RoutePlanning/3.3/Graph/Graph.cs (modified) (1 diff)
• HeuristicLab.Problems.RoutePlanning/3.3/Graph/Route.cs (added)

branches/RoutePlanning/HeuristicLab.Algorithms.GraphRouting/3.3/HeuristicLab.Algorithms.GraphRouting.csproj

@@ -57 +57 @@
   </ItemGroup>
   <ItemGroup>
+    <Compile Include="AStarAlgorithm.cs" />
     <Compile Include="DijkstraAlgorithm.cs" />
     <Compile Include="GraphRoutingAlgorithm.cs" />
     <Compile Include="IRouter.cs" />
+    <Compile Include="Pair.cs" />
     <Compile Include="Plugin.cs" />
+    <Compile Include="PriorityQueue.cs" />
     <Compile Include="Properties\AssemblyInfo.cs" />
   </ItemGroup>

branches/RoutePlanning/HeuristicLab.Problems.RoutePlanning/3.3/Graph/Graph.cs

@@ -117 +117 @@
       return (float)weight;
     }
+
+    public float EstimatedCosts(long sourceId, long targetId) {
+      Vertex<Node> source = GetVertex(sourceId);
+      Vertex<Node> target = GetVertex(targetId);
+      return EstimatedCosts(source, target);
+    }
+
+    public float EstimatedCosts(Vertex<Node> source, Vertex<Node> target) {
+      double distance = Utils.Distance(source.Node.Point, target.Node.Point);
+      int speed = 130;
+      double costs = (distance / speed) * 3.6;
+      return (float)costs;
+    }
   }
 }