java - implementing kruskal's algorithm utilizing threads -
I am implementing cruisal algorithms and I want to use threads. Although I'm not sure I know enough about algorithms to do this.
Do I feel that I will be sorted for different parts of the graph and finally connect. Can anyone point me in the right direction? Thank you.
to
Research focuses on resolving the minimum span The problem of tree in a highly parallel way is it possible to solve the problem in a linear number processor (Longan) time. A 2003 paper "Fast Shade-Memory Algorithm for Computing the Minimum Spanning Forure of Spares Graphs" David A. A practical algorithm by Badger and Guzing Kong shows that a compatible sequential algorithm can calculate MST 5 times faster than 8 processors. [9] Generally, parallel algorithms are based on Borovka's algorithm-prime, and in particular, cruisal algorithms do not even scale with additional processors.
So, you can look at the algorithm described in that paper, but Cruscle probably will not benefit from many sources.
Comments
Post a Comment