CODE:
subtrees = UnionFind()Tree = []nlist = [n for n in g.underlyingGraph.nodes]sList = []for u in nlist: inbr = [e for e in u.getEdgesInTree()] onbr = [e for e in u.getEdgesOutTree()] nbrs = inbr + onbr for e in nbrs: sList.append( (e.weight,u,e.target) )sList.sort()for W,u,v in sList: if subtrees[u] != subtrees[v]: Tree.append((u,v)) subtrees.union(u,v)
Statistics:Posted by rbelew — 02 Dec 2014 21:05