Description: On the network, the use of electronic maps is common. Electronic map can easily determine the path from one location to another. In particular, you can determine the bus transfer routes in the city. Electronic map can be seen as a map, bus route map can be viewed as a weighted directed graph G = (V, E), in which each side the right to non-negative real numbers. Your mission: on a given one (undirected) graph G, and G of the two points s and t, calculated from the vertex s to the vertex t shortest distance and minimum road number.
To Search:
File list (Check if you may need any files):
Dijkstra最短距离\4.cpp
................\44.msp
................\Debug\4.o
................\.....\44.exe
................\Debug
Dijkstra最短距离
Download