> ... Judging from the patch the overhead was killing you there... Entirely.
The new patch also allows the following notation: sage: G = list(graphs(7, implementation='c_graph')) sage: def test(G): ....: for i in xrange(len(G)): ....: for j in xrange(i+1,len(G)): ....: if G[i].is_isomorphic(G[j]): print "FAIL"; return ....: sage: %time test(G) CPU times: user 10.52 s, sys: 0.07 s, total: 10.59 s Wall time: 10.76 s --~--~---------~--~----~------------~-------~--~----~ To post to this group, send email to sage-devel@googlegroups.com To unsubscribe from this group, send email to sage-devel-unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/sage-devel URLs: http://www.sagemath.org -~----------~----~----~----~------~----~------~--~---
