I'm interested by what Robert Miller could have to say about the
efficiency of all this Such a change could really slow things
down, and I know nothing about such matters !
Nathann
On Nov 16, 6:58 pm, Nick Alexander wrote:
> > There have been lots of times that I had to deal with the issue
> There have been lots of times that I had to deal with the issue of the
> Graph edge (1,2) being the same as the edge (2,1); it's one of those
> thorns that keeps being a bit annoying, so I'm happy to have a small
> change that would take care of it. Maybe, to be consistent, Digraph
> edges shou
Nathann Cohen wrote:
> And what would you think about moving the current syntax for edges
> (u,v,label) to (frozenset_of_two_elements,label) ?
You mean functions returning edges would return tuples that looked like:
(frozen_or_sage_set_of_two_elements, label) ?
I think we should look carefully
Hi,
> I always have to include in my graphs functions some part of code to deal
> with the fact that for undirected graphs edges can be returned as (u,v) or
> as (v,u), which my code does not like Isn't there a Sage a type of
> variable which is both immutable and not ordered ?
>
> I'd
And what would you think about moving the current syntax for edges
(u,v,label) to (frozenset_of_two_elements,label) ?
Nathann
On Nov 16, 3:26 pm, Jason Grout wrote:
> Nathann Cohen wrote:
> > Hello !!!
>
> > I always have to include in my graphs functions some part of code to
> > deal with the
Nathann Cohen wrote:
> Hello !!!
>
> I always have to include in my graphs functions some part of code to
> deal with the fact that for undirected graphs edges can be returned as
> (u,v) or as (v,u), which my code does not like Isn't there a Sage a
> type of variable which is both immutabl
