- Timestamp:
- 08/08/12 13:40:03 (12 years ago)
- Location:
- branches/RoutePlanning/HeuristicLab.Algorithms.GraphRouting/3.3
- Files:
-
- 4 edited
Legend:
- Unmodified
- Added
- Removed
-
branches/RoutePlanning/HeuristicLab.Algorithms.GraphRouting/3.3/AStarAlgorithm.cs
r8362 r8429 5 5 namespace HeuristicLab.Algorithms.GraphRouting { 6 6 public class AStarAlgorithm : IRouter { 7 private Graph graph;7 private OsmGraph graph; 8 8 9 9 private Dictionary<long, float> distances; … … 14 14 private PriorityQueue<float, long> openList; 15 15 16 public AStarAlgorithm( Graph graph) {16 public AStarAlgorithm(OsmGraph graph) { 17 17 this.graph = graph; 18 18 } -
branches/RoutePlanning/HeuristicLab.Algorithms.GraphRouting/3.3/AStarAlgorithmV2.cs
r8426 r8429 5 5 namespace HeuristicLab.Algorithms.GraphRouting { 6 6 public class AStarAlgorithmV2 : IRouter { 7 private Graph graph;7 private OsmGraph graph; 8 8 9 9 private Dictionary<long, float> distances; … … 14 14 private Dictionary<long, NodeData> openListLookup; 15 15 16 public AStarAlgorithmV2( Graph graph) {16 public AStarAlgorithmV2(OsmGraph graph) { 17 17 this.graph = graph; 18 18 } -
branches/RoutePlanning/HeuristicLab.Algorithms.GraphRouting/3.3/BidirectionalDijkstraAlgorithm.cs
r8423 r8429 5 5 namespace HeuristicLab.Algorithms.GraphRouting { 6 6 public class BidrectionalDijkstraAlgorithm : IRouter { 7 private Graph graph;7 private OsmGraph graph; 8 8 9 9 private HashSet<long> visitedNodesForward; … … 16 16 private Dictionary<long, long> predecessorsBackward; 17 17 18 public BidrectionalDijkstraAlgorithm( Graph graph) {18 public BidrectionalDijkstraAlgorithm(OsmGraph graph) { 19 19 this.graph = graph; 20 20 } -
branches/RoutePlanning/HeuristicLab.Algorithms.GraphRouting/3.3/DijkstraAlgorithm.cs
r8314 r8429 5 5 namespace HeuristicLab.Algorithms.GraphRouting { 6 6 public class DijkstraAlgorithm : IRouter { 7 private Graph graph;7 private OsmGraph graph; 8 8 9 9 private HashSet<long> visitedNodes; … … 12 12 private Dictionary<long, long> predecessors; 13 13 14 public DijkstraAlgorithm( Graph graph) {14 public DijkstraAlgorithm(OsmGraph graph) { 15 15 this.graph = graph; 16 16 }
Note: See TracChangeset
for help on using the changeset viewer.