On Thursday, September 6, 2018 at 6:23:26 AM UTC-7, David Coudert wrote: > > Le jeudi 6 septembre 2018 14:16:33 UTC+2, Martin R a écrit : >> >> Would it be hard to separate vertex labels and vertices? In other words, >> vertices would always be 0,...,n-1, and there would be an additional array >> containing the vertex labels. >> > > Some graph backends do that, like `c_graph`. I'm not sure it's true for > all backends. > But, there might be situation in which it is useful to compare vertex > labels. > > > Also not ideal, but you could first try u < v, and if that fails, catch the error and use str(u) < str(v).
-- 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.
