Il 20/06/2010 23:52, Michele Comignano ha scritto:
The check_edge_label is where sage checks for equals labels in
http://hg.sagemath.org/sage-main/file/2cffe66bd642/sage/graphs/base/sparse_graph.pyx#l1
1318 <#l1318> if edge_labels[l_int] == l:
My opinion about that: I would remove rows 1408
Il 21/06/2010 09:14, Nathann Cohen ha scritto:
It is ! O_O
And I have to admit it would have required some time before I began to
suspect such a thing may have come from the graph backends... Good
work !!!
:)
I am adding Robert Miller in Cc as he will know better than anyone
else which part
Hello !!!
> Hope that's useful :)
It is ! O_O
And I have to admit it would have required some time before I began to
suspect such a thing may have come from the graph backends... Good
work !!!
I am adding Robert Miller in Cc as he will know better than anyone
else which parts of the library wou
Il 20/06/2010 23:25, Michele Comignano ha scritto:
But since python implementation doesn't reveal an error, it must be in
a backend implementation in some of the backends in
http://hg.sagemath.org/sage-main/file/2cffe66bd642/sage/graphs/base
that are extensions written in cython and it's too la
Il 20/06/2010 22:26, Nathann Cohen ha scritto:
Could you please give us an example of such a "strange behavior" when
using dictionaries as labels in Sage ?
Try the attached file. It creates a graph, then adds nodes and edges.
After, assigns a new element (a growing integer) to the label dict
Hello !!
Could you please give us an example of such a "strange behavior" when
using dictionaries as labels in Sage ?
Thanks !
Nathann
--
To post to this group, send an email to sage-devel@googlegroups.com
To unsubscribe from this group, send an email to
sage-devel+unsubscr...@googlegroups.co
