利用nx.all_pairs_shortest_path_length(Graph)计算网络全图最短路径

今天只做一件事~

已于 2022-09-14 22:35:24 修改

阅读量732

点赞数 1

分类专栏： Python-Networkx系列笔记文章标签： python

于 2022-09-14 09:36:36 首次发布

本文链接：https://blog.csdn.net/qq_38496798/article/details/126846191

版权

Python-Networkx系列笔记专栏收录该内容

3 篇文章 1 订阅

订阅专栏

该博客分别展示了如何使用无权无向网络和基于Dijkstra算法的无向加权网络来计算全局平均最短路径。首先，通过NetworkX库创建了一个无权无向网络，并定义了全局平均最短路径的函数，计算了所有节点间的平均最短路径长度。接着，对于加权网络，同样利用NetworkX的Dijkstra算法求解全局平均最短路径。这两个示例突显了在不同网络结构中计算最短路径的方法。

摘要由CSDN通过智能技术生成

##无权无向网络的全局最短路径
import networkx as nx

graph1 = nx.Graph()
graph1.add_nodes_from([1,2,3,4,5,6])
graph1.add_edges_from([(1,2), (2,3), (5,6), (1,5), (2,4)])

def global_average_shortest_path(Graph):
    Dict = dict(nx.all_pairs_shortest_path_length(Graph))
    length1 = len(Dict.values())
    total = 0
    edges_number = 0
    for sourcenodes in Dict.values():
        total = total +sum(sourcenodes.values())
        edges_number = edges_number + len(sourcenodes.values())
    average_shortest_path = total/(edges_number-length1)
    return average_shortest_path

print(global_average_shortest_path(graph1))

##基于dijkstra算法的无向加权网络全局平均最短路径

import networkx as nx

graph1 = nx.Graph()
graph1.add_nodes_from([1,2,3,4,5,6])
graph1.add_weighted_edges_from([(1,2,2), (2,3,1), (5,6,2), (1,5,3), (2,4,7)])

def global_average_shortest_path(Graph):
    Dict = dict(nx.all_pairs_dijkstra_path_length(Graph))
    length1 = len(Dict.values())
    total = 0
    edges_number = 0
    for sourcenodes in Dict.values():
        total = total +sum(sourcenodes.values())
        edges_number = edges_number + len(sourcenodes.values())
    average_shortest_path = total/(edges_number-length1)
    return average_shortest_path

print(global_average_shortest_path(graph1))