コード例 #1
0
ファイル: MSTLib.py プロジェクト: LeslieK/Algorithms-Python 
def getMinFBset(G):
	Gneg = negativeGraph(G)
	# finds MST of Gneg => max spanning tree of G
	kr = KruskalMST(Gneg)
	allEdges = set(Gneg.edges())
	spanningTreeEdges = set(kr.edges())
	return allEdges - spanningTreeEdges
コード例 #2
0
def getMinFBset(G):
    Gneg = negativeGraph(G)
    # finds MST of Gneg => max spanning tree of G
    kr = KruskalMST(Gneg)
    allEdges = set(Gneg.edges())
    spanningTreeEdges = set(kr.edges())
    return allEdges - spanningTreeEdges