#14455: Incomparability graph of a poset
---------------------------------------------------+------------------------
Reporter: serrano | Owner:
sage-combinat
Type: enhancement | Status:
needs_review
Priority: trivial | Milestone: sage-5.10
Component: combinatorics | Resolution:
Keywords: poset, graph | Work issues:
Report Upstream: N/A | Reviewers:
chrisjamesberg
Authors: Alejandro Morales, Luis Serrano | Merged in:
Dependencies: | Stopgaps:
---------------------------------------------------+------------------------
Changes (by chapoton):
* status: new => needs_review
Old description:
> A method for finding the incomparability graph of a finite poset. This
> graph is defined to have as vertex set the elements in the poset, with an
> edge between any two elements that are not comparable in the poset.
New description:
A method for finding the incomparability graph of a finite poset. This
graph is defined to have as vertex set the elements in the poset, with an
edge between any two elements that are not comparable in the poset.
Apply:
* [attachment:trac-14455-comparability_graph-fc.patch]
--
Comment:
here is a patch, please review !
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/14455#comment:1>
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?hl=en.
For more options, visit https://groups.google.com/groups/opt_out.
