Description: If there is a map on the chart and mark for each of the distance between the intersection, how to find out the shortest tour? Operations research introduces a kind of the shortest path problem the effective resolution of method, i.e. Dijkstra algorithm, the algorithm into program can make us more convenient to solve practical problems.
To Search:
File list (Check if you may need any files):
C language implemen.doc
Download