Hi all,
I'm benchmarking some graph libraries. I was excited to see that
Sage's graph library has a backend implemented in Cython.
Unfortunately, it seems to be orders of magnitude slower than a pure
NetworkX implementation. Here a code summary:
import networkx
# read in test adjacency matrix
Hello Jesse !
Well, for a start it wouldn't be very fair to compare graph libraries if
you do not use our graph methods and recode your own ! You seem to have
rewritten your version of strongly connected components to test the
libraries, and such low-level methods are in Sage written in
On Dec 23, 11:44 pm, Mark Manashirov mark.manashi...@gmail.com
wrote:
Hi,
Is there a reason why there are two copies of the notebook and simple
server files?
1) $SAGE_ROOT/devel/sage/sage/server
See http://trac.sagemath.org/sage_trac/ticket/11409 for the closest
thing to full detail on
