#17474: directed graph from polyhedron
-------------------------------------+-------------------------------------
Reporter: chapoton | Owner:
Type: enhancement | Status: needs_info
Priority: minor | Milestone: sage-6.5
Component: geometry | Resolution:
Keywords: polyhedron, | Merged in:
digraph | Reviewers:
Authors: Frédéric Chapoton | Work issues:
Report Upstream: N/A | Commit:
Branch: u/chapoton/17474 | dcf52646553cf73a3f1dff85b731a22bcc8b7ddd
Dependencies: | Stopgaps:
-------------------------------------+-------------------------------------
Comment (by tmonteil):
One could also want to provide a genuine linear form (see
`linear_transformation()` function) as an input, instead of a vector (this
could be useful in (possible future) case the underlying vector space is
not euclidean).
Also, it seems not very natural that the edges of the graph go in the
decreasing direction of the linear form (note that `v-w` is the vector
that goes from `w` to `v`, hence if an oriented edge `e` of the polyhedron
is viewed as a vector, it is selected if `f(e)<0`), but perhaps it makes
sense in the use case (it looks weird from an optimization perspective
such as simplex method (note that Sage's MILP maximizes by default)).
--
Ticket URL: <http://trac.sagemath.org/ticket/17474#comment:7>
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.
