Graph Processing Sketch

[David]

I posted the graph processing sketch created to demonstrate Dijkstra's algorithm for project 2 to my open processing portfolio.  

http://www.openprocessing.org/sketch/65275

To create a graph click to add vertices.  To add edges, press "e" then click to add edges.  To add more vertices press "v" then click to add more vertices.  When you want to run one of the graph search algorithms press "s" to select a source vertex, and click on the vertex.  To add an optional goal vertex press "g" then click a vertex.

To run Depth First Search press "d".  To run Breadth First Search press "b".  To run Dijkstra press "j".  Once a search algorithm is selected you need to press "n" multiple times to step through the algorithm.  You need to clear the visited vertices between runs by pressing "c".  Note:  The keys only work when you are in the sketch window.

Thanks,

David