Path Finder library

This library provides a set of classes to define a graph comprising of nodes and edges. Once defined the user can select from 4 different algorithms to find a path through the graph.

1. Depth First Search (DFS)
2. Breadth First Search (BFS)
3. Dijkstra
4. A* (using either Euclidean or Manhattan heuristics)

Although the download is packaged as a Processing library the actual code has no dependencies on Processing except the packaged examples. To use it without Processing simply unzip the download and locate the library jar file then link this as an external library in your own project.