On Sun, 12 Oct 2014, Nathann Cohen wrote:
True; also for example there could be "doublehasse", i.e. structure with
both upper and lower covers saved as a list for an element.
Isn't that already the case ? A hasse digram should be a (sparse)
digraph, and a (sparse) digraph should be stored twice internally,
once for in-neighborhood and one for out-neighborhood.
I don't know. Where should the code for that be?
Your implementation of static sparce graph is so fast that I don't know if
there is any significant difference at all.
Did you find the in-neighbors method too slow somewhere ? We had a
problem like that at some point.
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.
--
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 http://groups.google.com/group/sage-devel.
For more options, visit https://groups.google.com/d/optout.
