Hi, I wonder if there is a way in Sage to efficiently compute the diameter of a graph. The current example I have has 100.000 vertices and 500.000 edges, and calling diameter on it returns
"ValueError: The graph backend contains more than 65535 nodes" Looking at http://stackoverflow.com/questions/3038661/efficiently-finding-the-shortest-path-in-large-graphsand http://code.google.com/p/python-graph/, I feel like Sage should be able to do more than it currently does... Has anyone tried to do anything in this direction? Thanks, Christian -- You received this message because you are subscribed to the Google Groups "sage-devel" group. To unsubscribe from this group and stop receiving emails from it, send an email to sage-devel+unsubscr...@googlegroups.com. To post to this group, send email to sage-devel@googlegroups.com. Visit this group at http://groups.google.com/group/sage-devel. For more options, visit https://groups.google.com/groups/opt_out.
