Dijkstra's algorithm The program finds the shortest path and its' length from one given city to another. A graph is made using neighborhood matrix. P.S. the program works fine only on Unix :-)