如何用字典制作加权图？

R00bin 发表于 Dev

R00bin

我正在尝试从字典制作加权图。我认为获取数据的方式使工作变得困难。我得到的数据如下：

graph = {}

graph["A"] = {}
graph["A"] ["B"] = 1 
graph["A"] ["C"] = 3 
graph["A"] ["D"] = 2 

graph["B"] = {} 
graph["B"] ["D"] = 7
graph["B"] ["F"] = 5

graph["C"] = {}
graph["C"] ["E"] = 5

graph["D"] = {}
graph["D"] ["B"] = 7
graph["D"] ["E"] = 1

graph["E"] = {}
graph["E"] ["F"] = 4

graph["F"] = {}

父节点是一个字典，它存储具有边缘权重的邻居。

我可以使用networkx制作一个无权图：

for k, v in graph.items():
    G.add_edges_from(([(k,t) for t in v]))

但是我想不出一种增加权重的方法。
不幸的是，我无法编辑获取数据的方式，这是我可以想到的唯一选择。请帮忙

亚历克斯·奈

假设G是您的图表：

graph = {}

graph["A"] = {}
graph["A"] ["B"] = 1 
graph["A"] ["C"] = 3 
graph["A"] ["D"] = 2 

graph["B"] = {} 
graph["B"] ["D"] = 7
graph["B"] ["F"] = 5

graph["C"] = {}
graph["C"] ["E"] = 5

graph["D"] = {}
graph["D"] ["B"] = 7
graph["D"] ["E"] = 1

graph["E"] = {}
graph["E"] ["F"] = 4

graph["F"] = {}

for k,v in graph.items():
    for l, w in v.items():
        print(k, l, w)
        G.add_edge(k,l, weight=w)

文献资料

本文收集自互联网，转载请注明来源。

如有侵权，请联系 [email protected] 删除。