Description: A drive to the destination from a starting point a number of B' s line. Give you a description of the table to be selected routes (n* n matrix A), allows you to find the shortest travel distance routes. Table represents the connectivity of any two junctions, as well as distance. Matrix elements a (i, j) = 0 that junction i, j are not connected, a (i, j)! = 0 that junction i, j of the driving distance. A 1 at the junction where the starting point, destination B at the intersection n. Complete source DIST.CPP function in the preparation of Dijkstra.
To Search:
File list (Check if you may need any files):
dist.cpp
Download