Hey everyone,
This is preliminary version of a file I will be using for writing a series of tutorials on Abstract Data Types and search algorithms.
Here is the preview: http://www.kirupa.com/temp/path/path_test.html
Basically, you can specify the 2 points by clicking on the squares. You can only have two points selected at any given time, so you will have to unclick on a selected point before selecting a new point. It’s very user-friendly as you can tell (I’m kidding btw) 
The search method is depth-first, but the actual path drawing is different, so the line drawn omits a lot of nodes returned by the depth-first search.
Feel free to offer any comments/suggestions/etc. I’ll be going over and cleaning up some unnecessary methods and adding some needed features such as getting the name of an edge given a pair of nodes, etc.
Cheers!
Kirupa C:-)
