本文介绍了从python中的元组或集合列表中查找不相交的集合的处理方法，对大家解决问题具有一定的参考价值
问题描述
这是问题所在:我有一个元组列表(如果需要也可以设置).例如:
here is the problem: I have a list of tuples (could be sets as well if needed). For instance:
a = [(1, 5), (4, 2), (4, 3), (5, 4), (6, 3), (7, 6)]
我要找的是一个列表
r = [(1, 5, 4, 2, 3, 6, 7)]
因为一旦所有集合放在一起，交集就不是空的.
because the intersection is not empty once all the sets are put together.
举个例子
a = [(1, 5), (4, 2), (4, 3), (5, 4), (6, 3), (7, 6), (8, 9)]
结果应该是
r = [(1, 5, 4, 2, 3, 6, 7), (8, 9)]
希望问题很清楚.那么在 python 中最优雅的方法是什么?
Hope the problem is clear. So what is the most elegant way to do this in python, if any?
干杯
推荐答案
这些是图的连接组件，可以使用 networkx.对于您的第二个示例:
These are the connected components of a graph, and can be found using a graphing library such as networkx. For your second example:
>>> edges = [(1, 5), (4, 2), (4, 3), (5, 4), (6, 3), (7, 6), (8, 9)]
>>> graph = nx.Graph(edges)
>>> [tuple(c) for c in nx.connected_components(graph)]
[(1, 2, 3, 4, 5, 6, 7), (8, 9)]
这篇关于从python中的元组或集合列表中查找不相交的集合的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，WP2