A* pathfinding search in C# - Part 3(leniel.net)
submitted by 
leniel(489) 2 years, 2 months ago
This is the last installment in the series about A* search. The C# source code implemented is available in the final part of this post. As promised in the last words of A* pathfinding search in C# - Part 2 today we’re gonna run a test case using the Romania map. This post shows a test case in which the application outputs the shortest path from Arad to Bucharest. I used the ViewOtherPaths method to show the different possible routes. This way we can have a look at why the A* algorithm has chosen such shortest path.
|category: C#
|Views: 50
tags:
C# immutable Haversine geocoder priority another
Everyones tags:
Your Tags: