Beefy Boxes and Bandwidth Generously Provided by pair Networks
No such thing as a small change

Re: Prims MST Algorithm

by educated_foo (Vicar)
on Apr 22, 2013 at 17:20 UTC ( #1029932=note: print w/ replies, xml ) Need Help??

in reply to Prims MST Algorithm

If it works, use it. However, Prim's algorithm is O(E), so in a complete graph you will get worst-case performance. If you have a complete graph and Euclidean distances, I suspect you can do much better using some geometric algorithm, perhaps by sorting the vertices in one dimension and using a sweep-line algorithm.

Just another Perler interested in Algol Programming.

Comment on Re: Prims MST Algorithm

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://1029932]
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others browsing the Monastery: (3)
As of 2015-11-26 19:12 GMT
Find Nodes?
    Voting Booth?

    What would be the most significant thing to happen if a rope (or wire) tied the Earth and the Moon together?

    Results (706 votes), past polls