python 映射遍历_使用Networkx遍历图（Python）

这只能如果你有一个DAG(有向无环图)。 如果是这样你能得到你想要过的树 - 是这样的：

import uuid

import networkx as nx

import matplotlib.pyplot as plt

G = nx.DiGraph()

G.add_edge("A","B")

G.add_edge("A","H")

G.add_edge("H","C")

G.add_edge("B","C")

G.add_edge("B","D")

order = nx.topological_sort(G)

print "topological sort"

print order

# build tree

start = order[0]

nodes = [order[0]] # start with first node in topological order

labels = {}

print "edges"

tree = nx.Graph()

while nodes:

source = nodes.pop()

labels[source] = source

for target in G.neighbors(source):

if target in tree:

t = uuid.uuid1() # new unique id

else:

t = target

labels[t] = target

tree.add_edge(source,t)

print source,target,source,t

nodes.append(target)

nx.draw(tree,labels=labels)

plt.show()

绘图使用标签映射到节点的ID映射到原来的标签。