包含图中所有节点和边的字典

Question

I need to build a graph from a given list of edges like this:

Edges = ["cc-gc","cc-da","ee-cd","ee-bg","de-bg"]

from list of edges above, how do I get the graph like this:

graph = { "cc" : ["gc","da"],
      "gc" : ["cc"],
      "da": ["cc"],
      "ee": ["cd", "bg"],
      "cd": ["ee"],
      "de": ["bg"],
      "bg": ["de", "ee"]
    }

Answer 1

Using networkX we can build a graph by splitting the strings in the list and using nx.from_edgelist , and look for the nx.neighbors of each node:

import networkx as nx

G = nx.from_edgelist([s.split('-') for s in Edges])

graph = dict()
for node in G.nodes():
    graph[node] = list(nx.neighbors(G, node))

---

print(graph)

{'cc': ['gc', 'da'],
 'gc': ['cc'],
 'da': ['cc'],
 'ee': ['cd', 'bg'],
 'cd': ['ee'],
 'bg': ['ee', 'de'],
 'de': ['bg']}

Answer 2

Use networkx.convert.to_dict_of_lists :

import networkx as nx

edges = ["cc-gc", "cc-da", "ee-cd", "ee-bg", "de-bg"]

G = nx.from_edgelist([s.split('-') for s in edges])

print(nx.convert.to_dict_of_lists(G))

Output

{'bg': ['ee', 'de'],
 'cc': ['gc', 'da'],
 'cd': ['ee'],
 'da': ['cc'],
 'de': ['bg'],
 'ee': ['cd', 'bg'],
 'gc': ['cc']}

Answer 3

If the format is node1-node2 for all list elements a simple for loop does the trick

graph = {}
for edge in edges:
  node1, node2 = edge.split('-')
  if node1 in graph.keys():
    graph[node1] += [node2]
  else:
    graph[node1] = [node2]
  if node2 in graph.keys():
    graph[node2] += [node1]
  else:
    graph[node2] = [node1]