Re: [sage-devel] Py3, sorting vertices of graph
See https://trac.sagemath.org/ticket/22349 -- 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 https://groups.google.com/group/sage-devel. For more options, visit https://groups.google.com/d/optout.
[sage-devel] Py3, sorting vertices of graph
What is the situation with sorting of graph vertices in Python 3? Currently one can not, for example, create a poset with Py3. This comes down to 42 < 'xyz', which raises exception in Py3, but returns either True or False in Py2. Comparison is used in sorted(), which is used in .vertices() for (di)graphs. It is trivial to try sort vertices, and when failed, return them in an arbitrary order, but I don't know what would be broken then. -- Jori Mäntysalo