> I am pretty sure sage has A LOT OF bugs,
Indeed.
> why bother?
Because I use this thing and I need it to give correct answers :-P
> Probably a lot of them never will be fixed,
> never mind.
I am pretty sure that some bugs will never be fixed, but I won't allow a
bug to remain in the graph/ o
On Mon, Dec 23, 2013 at 04:31:46PM +0100, Nathann Cohen wrote:
> Yoo !!
>
> > lol, thanks.
> >
> > I liked your answers in this thread :)
>
> Cool ! :-D
>
> To be honest, I really believed that they had made you angry ^^;
>
No, I wasn't angry at all.
I am pretty sure sage has A LOT O
Yoo !!
> lol, thanks.
>
> I liked your answers in this thread :)
Cool ! :-D
To be honest, I really believed that they had made you angry ^^;
> Is .eulerian_circuit() expected to work on multigraphs?
Yes I believe so. The implementation of this function is really
elegant and calls "edge
On Mon, Dec 23, 2013 at 05:17:37AM -0800, Nathann Cohen wrote:
> Hell !!
>
> Here is a more responsible answer : I just created ticket #15572 to raise
> exceptions when a function is called which isn't supposed to deal with
> multiple edges and/or loops. I hope I found them all, but
Hell !!
Here is a more responsible answer : I just created ticket #15572 to raise
exceptions when a function is called which isn't supposed to deal with
multiple edges and/or loops. I hope I found them all, but in any case now
protecting such functions will just take one line. A
> if i understand correctly, Nathann is implying that
> if one works will multigraphs they shouldn't use sage
> for this task.
Indeed. Or that they should attempt to code what they need, because right
now I wouldn't feel confortable myself computing stuff on multigraphs.
> agree with this and do
if i understand correctly, Nathann is implying that
if one works will multigraphs they shouldn't use sage
for this task.
agree with this and do so.
On Tue, Dec 17, 2013 at 12:59:31PM +0100, Nathann Cohen wrote:
> Yooo !!
>
> > Why isn't are multigraphs (labelled graphs, graphs with loops
Yooo !!
> Why isn't are multigraphs (labelled graphs, graphs with loops etc)
> implemented as a separate class(es) which inherit from a stripped down
> version of graphs? This way graphs would not incur any speed penalty
because
> of all of these extra checks that are needed for these mor
Hi Nathann,
Why isn't are multigraphs (labelled graphs, graphs with loops etc)
implemented as a separate class(es) which inherit from a stripped down
version of graphs? This way graphs would not incur any speed penalty
because of all of these extra checks that are needed for these more
"exoti
I don't care much about this.
On Tue, Dec 17, 2013 at 11:22:12AM +0100, Nathann Cohen wrote:
> Yooo !!
>
> > Edge coloring multigraphs raises exception
>
> Ahahaha. That's possible.
>
> > sage:
> > P=graphs.PetersenGraph();ep=P.edges(labels=0);P2=Graph(ep+ep,multiedges
Yooo !!
> Edge coloring multigraphs raises exception
Ahahaha. That's possible.
> sage:
> P=graphs.PetersenGraph();ep=P.edges(labels=0);P2=Graph(ep+ep,multiedges=1)
> sage: graph_coloring.edge_coloring(P2,value_only=1)
> 7 # not sure this is correct
It most probably isn'
11 matches
Mail list logo
