- Category:
- CSharp
- Tags:
-
[Text]
- File Size:
- 2kb
- Update:
- 2015-08-14
- Downloads:
- 0 Times
- Uploaded by:
- 焦慧明
Description: Floyd (Floyd) algorithm is mainly used to calculate the length of the shortest distance between the drawing algorithm between all pairs of vertices, if the requirements of a specific point to the diagram all the shortest distance between vertices can Dijkstra (Dinger Stella) algorithm to find.
Floyd algorithm process (Floyd) algorithm is:
1, starting any one-sided way. The distance between two points is all right edge, if there is no edge connected between two points, the right to infinity.
2. For every pair of vertices u and v, and see if there is a vertex w such that w u to v and then shorter than the known path. If you are updating it.
Figure that out of the adjacency matrix G, if there is a road up Vi to Vj, then G [i, j] = d, d represents the length of the path otherwise G [i, j] = infinity. Define a matrix D used to record the information of the inserted point, D [i, j] represents Vi to Vj need to go through the points, initialize D [i, j] = j. The inset in e
To Search:
File list (Check if you may need any files):
Floyd-C#.txt
Download