Can someone help out with writing a graphing algorithum

[nis]

I took the time to write out and explain what graphing means on a computer but then my computer froze and i am way to lazy to type it out again. So if you dont know what i am talking about thanks anyways. I need to write a proram that will find me the cheapest route to a number of verticies in a graph. The Graph is directional and each edge has a certain cost. If you have or know of a place where i can get one or learn to write one please tell me thanks

[Tony]

sounds like something involving recursion

[Andy]

use whatdotcolor and trace through each point when the directio changes dramatically, then u noe there is a verticy