On Mon, Oct 15, 2012 at 10:20:14AM -0700, Nathann Cohen wrote:
> What is strange to me the SEGV is non-deterministic (different graphs
>
> > each time), which might be a sign of a deeper problem maybe not in your
> > code :)
> >
>
> Ahahaah. I do not doubt that the problem is in my code :-)
>
What is strange to me the SEGV is non-deterministic (different graphs
> each time), which might be a sign of a deeper problem maybe not in your
> code :)
>
Ahahaah. I do not doubt that the problem is in my code :-)
Nathann
--
You received this message because you are subscribed to the Goog
On Sat, Oct 13, 2012 at 01:32:22AM -0700, Nathann Cohen wrote:
> Considering that you code does not use the induced = True flag, the values
> of H equal to [graphs.CompleteGraph(2),graphs.CompleteGraph(1), 2 *
> graphs.CompleteGraph(1)] will respectively return
>
> 1) the list of edges
> 2) th
Hello !!
Well, it is a bug indeed but it looks like it always happen when you look
for subgraphs of G isomorphic to the empty graph (one vertex, no edge).
So I would say that using this function can be easily avoided
in that case :-P
Considering that you code does not use t
HM O_O;;
I wanted to rewrite it anyway :-D
No idea where it comes from. I will attempt to tell you today :-)
Nathann
On Saturday, October 13, 2012 9:15:06 AM UTC+2, Georgi Guninski wrote:
>
> Package nauty is not needed, attached is gra2() |for g in graphs(k)|
>
>
> On Sat, Oct 13, 201
Package nauty is not needed, attached is gra2() |for g in graphs(k)|
On Sat, Oct 13, 2012 at 09:59:56AM +0300, Georgi Guninski wrote:
> 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/
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 usu
