This is my attempt at pathfinding, its designed on a hexagonal grid.
Ive implemented djikstra, djikstra with multi path and an alternative to a* which provides step count from each node to every other node. Although this isnt yet complete.
Also not it is slow as i do not make use of PGraphics.
Paths have parent nodes and can also be used to pathfind.
For an understanding of the a* algorithm you could always check Dan Shiffman
A comparison of the different algorithms.
Depth first, breadth first, djikstra, a*
