# Simple Path Finder

**URL:** <https://forum.kirupa.com/t/simple-path-finder/174230>\
**Category:** open source\
**Created:** [January 4, 2006, 12:35am UTC](https://forum.kirupa.com/t/simple-path-finder/174230 "2006-01-04T00:35:41Z")\
**Posts on this page:** 1\
**Page:** 1

<div class="post-metadata">

**Author:** ![kirupa](https://yyz1.discourse-cdn.com/flex011/user_avatar/forum.kirupa.com/kirupa/32/11616_2.png) [@kirupa](https://forum.kirupa.com/u/kirupa)\
**Post date:** [January 4, 2006, 12:35am UTC](https://forum.kirupa.com/t/simple-path-finder/174230/1 "2006-01-04T00:35:41Z")

</div>

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](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:-)