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.

并行dijkstra最短路径算法\readme.txt
........................\shortest.c
........................\ShortestEnhance.c
........................\并行dijkstra最短路径算法.doc
........................\.馐允

• 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．