Second min cost spanning tree.

Posted by Evil on Stack Overflow See other posts from Stack Overflow or by Evil
Published on 2010-04-22T16:30:45Z Indexed on 2010/04/22 16:33 UTC
Read the original article Hit count: 193

Filed under:

Hello. I'm writing an algorithm for finding the second min cost spanning tree. my idea was as follows:

1) Use kruskals to find lowest MST. 2) Delete the lowest cost edge of the MST. 3) Run kruskals again on the entire graph. 4) return the new MST.

My question is this: Will this work? Is there a better way perhaps to do this?

© Stack Overflow or respective owner

Related posts about graph