Yo !
> If < is not a total order then you need to define the permutation with
> respect to a chosen set of vertex labels (another UniqueRepresentation for
> vertex label set). Though frankly I'd be happy to require that vertex labels
> are sortable if distinct.
We have a lot of code in Graph that are only there because you cannot
assume that vertices can be compared.
sage: {1}<{2}
False
sage: {2}<{1}
False
sage: Set([1])<Set([2])
True
sage: Set([2])<Set([1])
True
And I swear that I already had to create digraphs whose vertices are sets.
> If == is not transitive then you have to define what you mean by "same" set
> of points.
No problem there, == is well defined.
Nathann
--
You received this message because you are subscribed to the Google Groups
"sage-devel" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to sage-devel+unsubscr...@googlegroups.com.
To post to this group, send email to sage-devel@googlegroups.com.
Visit this group at http://groups.google.com/group/sage-devel.
For more options, visit https://groups.google.com/d/optout.
