我正在尝试使用 networkx 来计算两个节点之间的最短路径。例如:
paths = nx.shortest_path(G, ‘A’, ‘C’, weight=‘cost’)
paths
会返回类似:
[‘A’、‘B’、‘C’]
nx.shortest_path_length()
返回该路径的成本,这也很有帮助。但是,我也想返回该路径遍历的边的列表。在这些边缘内是我存储的其他属性,我想返回它们。
这可能吗?
这是一个可以满足您所有需要的代码(希望是:p):
import numpy as np
# import matplotlib.pyplot as plt
import networkx as nx
# Create a random graph with 8 nodes, with degree=3
G = nx.random_regular_graph(3, 8, seed=None)
# Add 'cost' attributes to the edges
for (start, end) in G.edges:
G.edges[start, end]['cost'] = np.random.randint(1,10)
# Find the shortest path from 0 to 7, use 'cost' as weight
sp = nx.shortest_path(G, source=0, target=7, weight='cost')
print("Shortest path: ", sp)
# Create a graph from 'sp'
pathGraph = nx.path_graph(sp) # does not pass edges attributes
# Read attributes from each edge
for ea in pathGraph.edges():
#print from_node, to_node, edge's attributes
print(ea, G.edges[ea[0], ea[1]])
输出将类似于以下内容:
Shortest path: [0, 5, 7]
(0, 5) {'cost': 2}
(5, 7) {'cost': 3}
本文内容由网友自发贡献,版权归原作者所有,本站不承担相应法律责任。如您发现有涉嫌抄袭侵权的内容,请联系:hwhale#tublm.com(使用前将#替换为@)