Tuesday, 10 December 2013

Graph algorithms: Prim's minimum spanning tree

The F# Journal just published an article about graph algorithms:
"Prim's algorithm for computing the minimum spanning tree associates a predecessor and distance with each vertex and uses a searchable priority queue to add the lightest-weight vertices to the tree until the minimum spanning tree has been found. This article examines both pure and impure implementations of Prim's algorithm..."
To read this article and more, subscribe to The F# Journal today!

2 comments:

Art said...

http://www.ijascse.org/volume-2-issue-5/MST.pdf

A New Parallel Alg for MST by Tripathy and Ray, 2013

How does or would .NET implement parallel MST best? Would Impure or Pure matter?

Thanks

Jon Harrop said...

Great question! I'll take a look... :-)