- Category:
- MPI
- Tags:
-
[C/C++]
[源码]
- File Size:
- 727kb
- Update:
- 2012-11-26
- Downloads:
- 0 Times
- Uploaded by:
- joyceqh
Description: Parallelized dijkstra algorithm. Suppose there is p a processor, N vertex. Give each processor distribution N/p a vertex, find out the local minimum value, complexity is O (N/p). And then later half of the processors will sent its own minimum value to the first former p/2 processors. the first half receive the value of the processor and compare with the local minimum value,as a new value. Continue the circulation, until only one processor is left.
To Search:
File list (Check if you may need any files):
并行dijkstra最短路径算法\readme.txt
........................\shortest.c
........................\ShortestEnhance.c
........................\并行dijkstra最短路径算法.doc
........................\.馐允
Download