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. read more...

add a comment |category: C# |Views: 50

tags: C# immutable Haversine geocoder priority another

A* pathfinding search in C# - Part 2(leniel.net)

submitted by leniel(489) 2 years, 2 months ago

This post describes step by step the methods used to implement the A* search algorithm. To illustrate the path finding problem and how it can be solved using A* I decided to use the Romania map (with the same Cities I used in Breadth and depth first search series of posts). Now I modified it adding more connections between the cities so that we have more fun while debugging the code. This time I decided to get the real values of latitude and longitude for the cities shown in the Romania map. See how a graph of cities is assembled using the real geocode values for latitude and longitude using Google Maps service. read more...

add a comment |category: C# |Views: 47

tags: C# Haversine intelligence immutable geocoder another