All minimum spanning trees implementation

Posted by russtbarnacle on Stack Overflow See other posts from Stack Overflow or by russtbarnacle
Published on 2010-05-29T16:17:22Z Indexed on 2010/05/29 16:22 UTC
Read the original article Hit count: 251

I've been looking for an implementation (I'm using networkx library.) that will find all the minimum spanning trees (MST) of an undirected weighted graph.

I can only find implementations for Kruskal's Algorithm and Prim's Algorithm both of which will only return a single MST.

I've seen papers that address this problem (such as http://fano.ics.uci.edu/cites/Publication/Epp-TR-95-50.html) but my head tends to explode someway through trying to think how to translate it to code.

In fact i've not been able to find an implementation in any language!

© Stack Overflow or respective owner

Related posts about python

Related posts about algorithm