Path Finder library

The purpose of this library is to provide a set of classes to define a graph comprising of nodes and edges. Then allow the user to select from 4 different algorithms (Depth First, Breadth First, Dijkstra, A*) to find a path through the graph. Although suitable for games it can be used in a wide range of problems involving networks.

Although the download is packaged as a Processing library the actual code has no dependencies on Processing except the 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.