This is a program that finds the shortest possible path between two paths using the A* algorithm. This has been built in C#. The Heuristic is calculated using Pythagurus.
For reference please not all of the projects code is in Program.CS Navigate to grid.txt in the resouces folder. You can make the grid any size. Please seperate columns using commas and rows using new lines. Below is the key for the values:- O = Obstacle
- S = Start Node
- E = End Node
- number = node value
- Has a colour-coded output grid
- Set start node,end node, obstacles and node weights from external file
- Works
