使用networkX:
import networkx as nx
G1=nx.Graph()
G1.add_edges_from([("a","b"),("b","c"),("c","d"),("d","e"),("f","g")])
sorted(nx.connected_components(G1), key = len, reverse=True)
给予:
[['a', 'd', 'e', 'b', 'c'], ['f', 'g']]
您现在必须检查最快的算法…
OP:
这很棒!我现在在我的Postgresql数据库中。只需将对组织到一个两列的表中,然后用于array_agg()
传递给PL / Python函数get_connected()
。谢谢。
CREATE OR REPLACE FUNCTION get_connected(
lhs text[],
rhs text[])
RETURNS SETOF text[] AS
$BODY$
pairs = zip(lhs, rhs)
import networkx as nx
G=nx.Graph()
G.add_edges_from(pairs)
return sorted(nx.connected_components(G), key = len, reverse=True)
$BODY$ LANGUAGE plpythonu;