这应该适用于任意树,但可以简化为二叉树,如示例所示。
import networkx as nx
H = nx.DiGraph([(0, 1), (0, 12), (1, 2), (1, 3), (3, 4), (3, 7), (4, 5), (4, 6),
(7, 8), (7, 9), (9, 10), (9, 11), (12, 13), (12, 14)])
# iterate over nodes starting at the root
order = nx.topological_sort(H)
root = next(order)
labels = {root : list()}
for node in order:
parent_node = next(H.predecessors(node))
parent_label = labels[parent_node]
# check for labeled siblings before creating a new label
ii = 0
while parent_label + [ii] in labels.values():
ii += 1
labels[node] = parent_label + [ii]
print(labels)
# {0: [], 12: [0], 14: [0, 0], 13: [0, 1], 1: [1], 3: [1, 0], 7: [1, 0, 0], 9: [1, 0, 0, 0], 11: [1, 0, 0, 0, 0], 10: [1, 0, 0, 0, 1], 8: [1, 0, 0, 1], 4: [1, 0, 1], 6: [1, 0, 1, 0], 5: [1, 0, 1, 1], 2: [1, 1]}