#17216: Poset / LatticePoset: [meet|join]matrix algorithm
-----------------------------+---------------------------------
Reporter: jmantysalo | Owner:
Type: enhancement | Status: new
Priority: major | Milestone: sage-wishlist
Component: combinatorics | Keywords:
Merged in: | Authors:
Reviewers: | Report Upstream: N/A
Work issues: | Branch:
Commit: | Dependencies:
Stopgaps: |
-----------------------------+---------------------------------
First, because `meet()` is defined on `LatticePoset`, not on `Poset`, it
is logical to also move `meet_matrix()` there.
Second, `hasse_diagram.py` contains
{{{
le = copy(self.lequal_matrix())
for i in range(n): le[i,i] = 1
}}}
This is unneeded, because `lequal_matrix()` already contains ones at
diagonal. We can use `_leq_matrix` directly.
Third, maybe the whole algorithm could be written better.
All this applies dually to `join`.
--
Ticket URL: <http://trac.sagemath.org/ticket/17216>
Sage <http://www.sagemath.org>
Sage: Creating a Viable Open Source Alternative to Magma, Maple, Mathematica,
and MATLAB
--
You received this message because you are subscribed to the Google Groups
"sage-trac" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
To post to this group, send email to [email protected].
Visit this group at http://groups.google.com/group/sage-trac.
For more options, visit https://groups.google.com/d/optout.
