About

Explores A* and Dijkstra's shortest-path algorithms. The graph data structure that is implemented uses an adjacency list to keep track of the nodes and edges, as well as how they are related. The implemented graph is used to find the shortest path in a generated environment. Processing is used for the front end. The PApplet library that is use…

Stars

Watchers

Forks