Hello ! > 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. Did you find the in-neighbors method too slow somewhere ? We had a problem like that at some point. 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.
