Search algorithms are at the core of PCGEx Pathfinding nodes & capabilities. They are responsible for traversing individual clusters in search for the ideal path between the seed and goal points.
At the time of writing, there are only two algorithms implemented, A Start and Dijkstra. The next implementation candidates will be DFS and BFS as they yield slightly different results, althought less friendly to modifiers.
