I am trying to find the average shortest path length for my network. I am currently trying to find it by running dist = gt.shortest_distance(g) and then finding the average of the results. I however find that for a lot of distances I get the value "2147483647" which is seemingly imposisbly large for my network and crops up in the example results in the documentation too (I only have 718 vertices and 979 edges in my graph). Does this value have a special significance? Does it mean there is no path between the given vertices?
Also, seeing as there is no reference to it in the documentation I presume that this algorithm has not been parallelised? -- View this message in context: http://main-discussion-list-for-the-graph-tool-project.982480.n3.nabble.com/Average-path-length-shortest-distance-2147483647-tp4026708.html Sent from the Main discussion list for the graph-tool project mailing list archive at Nabble.com. _______________________________________________ graph-tool mailing list [email protected] https://lists.skewed.de/mailman/listinfo/graph-tool
