This also affects various computations in the `homology` directory, since a common practice is to take a simplicial complex and discard everything above dimension 1, and then look at the resulting graph. If the vertices in the original simplicial complex have labels which are not sortable in Python 3, these computations fail. So I would very much appreciate it if someone who knows the graph theory parts of Sage could investigate this.
-- John On Thursday, August 30, 2018 at 7:04:12 AM UTC-7, Jori Mäntysalo wrote: > > 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 > -- 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.
