A blueprint implementation of the Dijkstra shortest path algorithm on an exagonal grid.
The project come with a level that includes a randomly generated map with obstacles and waypoints, that illustrates the algorithm result.
You can download the whole project or only the exported blueprint in the Release link.
Click on the following image for a demonstration video:
