There appears to have been a slow down in the is_isomorphic
method of the Graph class. The code segment below (just
the part timed with %time) runs in 0.7 seconds in Sage 3.1.1
and 2.2 seconds in Sage 3.2.3 and Sage 3.3. Both times are
on my MacBook Pro at 2.1 GHz.
The code simply downloads some graphs and checks that they
are all distinct. Here are the graphs:
import urllib2
f = urllib2.urlopen('http://cs.anu.edu.au/~bdm/data/graph6.g6')
graph_strings = f.readlines()
f.close()
some_graphs = [Graph(graph_string) for graph_string in graph_strings]
And here is the timed code:
%time
result = false
for i in xrange(0,len(some_graphs)-1):
for j in xrange(i+1, len(some_graphs)):
if some_graphs[i].is_isomorphic(some_graphs[j]):
result = true
break
if result:
break
result
Mark McClure
--~--~---------~--~----~------------~-------~--~----~
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
-~----------~----~----~----~------~----~------~--~---
