On Wed, 20 Jan 2016, Travis Scrimshaw wrote:
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.
--
Jori Mäntysalo
