Dijkstra shortest path on hex grid

Hi, just an exercise :smiley:
A level that demonstrate how implement Dijkstra shortest path on en hexagonal grid in blueprints.
Anyway, doing this again, I will use C++ for sure.
Even for a relatively short algorithm like this the blueprint graph becomes quite large.

Github: GitHub - salvatorespoto/DijkstraBlueprint: A blueprint implementation of the Dijkstra shortest path algorithm on an exagonal grid

1 Like

Beautyful! Thats really something see 20000 exagon all togheter XD
Thanks for share

Thanks a lot for that blueprint :slight_smile: While i was unable to open your uploaded project, the migrated blueprints did the trick ^.^