No answer to the main question, but just completing the timings: sage: G=graphs.RandomGNP(300,.1) sage: time d=[G.distance(i,j) for (i,j) in Subsets(G.vertices(),2)] CPU times: user 3.67 s, sys: 0.00 s, total: 3.67 s Wall time: 3.72 s sage: time d=networkx.all_pairs_shortest_path(G) CPU times: user 2.59 s, sys: 0.00 s, total: 2.59 s Wall time: 2.61 s sage: time e=networkx.all_pairs_shortest_path_length(G.networkx_graph (copy=False)) CPU times: user 1.34 s, sys: 0.00 s, total: 1.34 s Wall time: 1.36 s
-- To post to this group, send an email to sage-devel@googlegroups.com To unsubscribe from this group, send an email to sage-devel-unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/sage-devel URL: http://www.sagemath.org
