Description: Description of the problem: the average path length is another important network characteristics measure between all pairs of nodes in the network, the average shortest distance. Here the distance between nodes refers to the minimum number from one node to be subjected to the edge, wherein the maximum distance is referred to as the diameter of the network between all nodes. The average path length and diameter measurement of the performance and efficiency of the network' s transmission. The formula of the average path length, where dij indicates the shortest distance between points i and j (if dij is not present, dij can not join, and the denominator accordingly minus 1) requirements: Input adjacency matrix shows, to calculate its average path length
To Search:
File list (Check if you may need any files):
程序_图的平均路径长度\DArray.c
.....................\DArray.h
.....................\LinkList.c
.....................\LinkList.h
.....................\main.c
.....................\MatrixGraph.c
.....................\MatrixGraph.h
.....................\readme.txt
程序_图的平均路径长度
Download