RuntimeError: Segmentation fault in Graph.subgraph_search()
Tested on binary 5.3 from sagemath on Ubuntu 10.04 and on
sagenb.org: http://sagenb.org/home/pub/5036.
Many calls to Graph.subgraph_search() give Segmentation fault,
though on different graphst.
Here is a program that gives SEGV on usually different graphs:
def gra1():
f=[graphs.CompleteGraph(2),graphs.CompleteGraph(1), 2 *
graphs.CompleteGraph(1)]
for k in xrange(1,8):
for g in graphs.nauty_geng("%s"%k):
for h in f:
print
'h=Graph("%s");g=Graph("%s")'%(h.sparse6_string(),g.sparse6_string())
aa=g.subgraph_search(h)
gra1()
...
h=Graph(":@");g=Graph(":DoN")
RuntimeError: Segmentation fault
On different runs $h$ and $g$ might be different.
On sagenb.org:
h=Graph(":@");g=Graph(":CwN")
Traceback (click to the left of this block for traceback)
...
RuntimeError: Segmentation fault
--
You received this message because you are subscribed to the Google Groups
"sage-support" group.
To post to this group, send email to [email protected].
To unsubscribe from this group, send email to
[email protected].
Visit this group at http://groups.google.com/group/sage-support?hl=en.
