Let the vertex is greater than 1, no more than 30, with a number that each vertex (if a graph with n vertices, their numbers are 0, 1, 2, 3, ..., n-1). This network entitled to seek a shortest path between vertices, we can establish the right of the fare for the adjacency matrix, using Dijkstra' s algorithm for the shortest path length. Dijkstra' s algorithm has an auxiliary vector D, the found that the current from the source point to the other points of the shortest path length. Because every time to find the minimum value in the D, to improve performance, with the minimum heap priority queue storage D values.

zuiduan\Debug\themain.obj
.......\.....\vc60.idb
.......\.....\vc60.pdb
.......\.....\zuiduan.exe
.......\.....\zuiduan.ilk
.......\.....\zuiduan.pch
.......\.....\zuiduan.pdb
.......\dijkstra.h
.......\floyd.h
.......\Graph.h
.......\themain.cpp
.......\zuiduan.dsp
.......\zuiduan.dsw
.......\zuiduan.ncb
.......\zuiduan.opt
.......\zuiduan.plg
.......\Debug
zuiduan

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．