python生成连线图,如何使用python的networkx模块从节点列表生成完全连接的子图

I need to generate a fully connected subgraph with networkx, starting from the list of nodes I want to connect. Basically, I want all the nodes in the list I pass to the function to be all connected with each other.

I wonder if there is any built-in function to achieve this (which I haven't found)?

Or should I think of some algorithm?

Thank you very much.

解决方案

I don't know of any method which does this, but you can easily mimic the complete_graph() method of networkx and slightly change it(almost like a builtin):

import networkx

import itertools

def complete_graph_from_list(L, create_using=None):

G = networkx.empty_graph(len(L),create_using)

if len(L)>1:

if G.is_directed():

edges = itertools.permutations(L,2)

else:

edges = itertools.combinations(L,2)

G.add_edges_from(edges)

return G

S = complete_graph_from_list(["a", "b", "c", "d"])

print S.edges()