Expert: Prince M. Premnath - 8/15/2009

Question
could u pls help mi.i realli need your help.could u pls guide mi,i realli do nt knw wat should i do n hw should i start to do it.i will be so appreciated for all the help from you.i was given a map that shows the cities and their distance.i hv to represent the map shown with a weighted graph, and i hv to write the given start and destination,it will display the shortest route between them.  

Answer
Hi dear Gina !

   kindly refer the following link for understanding the weighted graph into programmable construct  
http://renaud.waldura.com/doc/java/dijkstra/

and for some C++ code help please refer the following link
http://ds4beginners.wordpress.com/2006/12/17/code-2-for-dijkstras-shortest-path-...

hope it will help you out!

Thanks and Regards!
Prince M. Premnath