BrychanD/Shortest-Total-Path-Algo
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

Fixed heuristic not being calculated for the child nodes correctly

Browse Source
This commit is contained in:
Brychan Dempsey 2021-10-23 01:12:15 +13:00
parent 2a1c7c8c5e
commit ef67b5cf5e
1 changed files with 3 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

5
ShortestTotalPath/Program.cs
View File

@ -62,8 +62,9 @@ namespace ShortestTotalPath
Console.Write(" -> "); Console.Write(" -> ");
} }
} }
} }
Console.WriteLine("Finished");
Console.ReadLine(); Console.ReadLine();
} }
@ -134,7 +135,7 @@ namespace ShortestTotalPath
double length = poppedNode.TotalTraversedLength + poppedNode.Children[child]; double length = poppedNode.TotalTraversedLength + poppedNode.Children[child];
Node qNode = new(child, poppedNode, length); Node qNode = new(child, poppedNode, length);
// A admissible (never over-estimates) heuristic is largest distance to an un-traversed node from our current node. // A admissible (never over-estimates) heuristic is largest distance to an un-traversed node from our current node.
qNode.LocalHeuristic = poppedNode.FarthestUnvisitedNodeDistance(); qNode.LocalHeuristic = qNode.FarthestUnvisitedNodeDistance();
// Add the node to the queue // Add the node to the queue
queue.Add(qNode, length); queue.Add(qNode, length);
} }