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

程序_图的平均路径长度\DArray.c
.....................\DArray.h
.....................\LinkList.c
.....................\LinkList.h
.....................\main.c
.....................\MatrixGraph.c
.....................\MatrixGraph.h
.....................\readme.txt
程序_图的平均路径长度

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．