Yo ! > I don't know. Where should the code for that be?
sage: d = DiGraph() sage: d._backend <class 'sage.graphs.base.sparse_graph.SparseGraphBackend'> sage: b=d._backend sage: b.iterator_in_nbrs?? > Your implementation of static sparce graph is so fast that I don't know if > there is any significant difference at all. Usually all the time is wasted translating arbitrarily labelled vertices into ints. > Not a real problem. At http://trac.sagemath.org/ticket/13223 Darij Grinberg > writes "I've improved the situation in #13240; the algorithm is now > polynomial time. Wouldn't hurt to improve it nevertheless." Actually > algorithm is linear already. I was just thinking what he have had in mind > when writing that; there doesn't seem to be significantly better algorithm. Oh. Well, you can send him an email. I will take a lot at it right now, however. I have a lot of work to do, and you give me an occasion to not touch it. 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.
