Changeset 8356 for branches/RoutePlanning/HeuristicLab.Algorithms.GraphRouting/3.3/AStarAlgorithm.cs
- Timestamp:
- 07/30/12 13:32:18 (12 years ago)
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
branches/RoutePlanning/HeuristicLab.Algorithms.GraphRouting/3.3/AStarAlgorithm.cs
r8350 r8356 9 9 private Dictionary<long, float> distances; 10 10 private Dictionary<long, long> predecessors; 11 private List< float> closedList = new List<float>();11 private List<long> closedList; 12 12 //private PriorityQueueOld<float, long> openList; 13 13 private PriorityQueue<float, long> openList; … … 22 22 distances = new Dictionary<long, float>(); 23 23 predecessors = new Dictionary<long, long>(); 24 closedList = new List< float>();24 closedList = new List<long>(); 25 25 //openList = new PriorityQueueOld<float, long>(); 26 26 openList = new PriorityQueue<float, long>(new MyComparer()); … … 59 59 openList.Enqueue(f, neighbor.Key); 60 60 } 61 closedList.Add(currentNode); 61 62 } 62 63 throw new Exception(string.Format("No route found from {0} to {1}", sourceNodeId, targetNodeId));
Note: See TracChangeset
for help on using the changeset viewer.