Please try out our Pathfinding Example project

H: Generates a hexagon graph
D: Destroys current graph
B: Starts a Breadth First Search
J: Runs Dijkstra’s algorithm
T: Traces path after BFS is complete
A: Runs A* algorithm
Clicking on a Hexagon changes its movment cost as follows:
– White = 1
– Pink = 4
– Yellow = 10
– Black = impassable