> > > The idea is that HasseDiagram is suppose to be a subclass of DiGraph > > labelled by 1, 2, ..., n (so there is an implicit fixed linear > extension) > > and that Poset works by being the slight abstraction where we have a set > > with a partial order. > > I know that. But now there exists two types of code. > > First where HasseDiagram has a function foo() returning for example [0, 1] > and Poset function foo() that basically says return [_vertex_to_element(e) > for e in self._hasse_diagram.foo(...)]. > > And other where Poset has just bar() starting with H = self._hasse_diagram > and then computing on H, using H.neighbors_in(...) and so on. > > The former is when the Poset is acting as an adapter class, and the latter is something where there either is no analog currently on the backend (there might be no gain because there is no analog (di)graph function or translation cost). It depends on the situation and is just trying to be effective code.
Best, Travis -- 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.
