Python路径分析：如何使用NetworkX库查找最短路径？

<code class="bash">pip install networkx</code>

<code class="python">import networkx as nx

# 创建无向图
graph = nx.Graph()

# 添加节点
graph.add_nodes_from(['A', 'B', 'C', 'D'])

# 添加边及权重（可选，用于加权最短路径）
graph.add_weighted_edges_from([('A', 'B', 1), ('B', 'C', 2), ('C', 'D', 3), ('A','C',5)])</code>

<code class="python"># 查找A到D的最短路径 (无权图)
path = nx.shortest_path(graph, source='A', target='D')
print(f"最短路径 (无权): {path}")

# 查找A到D的最短路径 (加权图)
path_weighted = nx.shortest_path(graph, source='A', target='D', weight='weight')
print(f"最短路径 (加权): {path_weighted}")
</code>

<code class="python"># 获取A到D的最短路径长度 (无权图)
path_length = nx.shortest_path_length(graph, source='A', target='D')
print(f"最短路径长度 (无权): {path_length}")

# 获取A到D的最短路径长度 (加权图)
path_length_weighted = nx.shortest_path_length(graph, source='A', target='D', weight='weight')
print(f"最短路径长度 (加权): {path_length_weighted}")</code>

<code class="python">for node in path:
    print(node)</code>