New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
CombinatorialPolyhedron: edge_graph -> vertex_graph #28603
Comments
This comment has been minimized.
This comment has been minimized.
Branch: public/28603 |
New commits:
|
Commit: |
comment:4
It is good to go. |
Reviewer: Laith Rastanawi |
Branch pushed to git repo; I updated commit sha1 and set ticket back to needs_review. New commits:
|
comment:7
Could the sentence also include what function the use should use instead? |
Branch pushed to git repo; I updated commit sha1 and set ticket back to needs_review. New commits:
|
comment:9
Replying to @jplab:
Sure. The deprecation warning doesn't show in normal use. When you run the doctest manually it won't show. If you pack it in
it is printed when calling |
Branch pushed to git repo; I updated commit sha1. New commits:
|
comment:11
The deprecation warning is now printed out. So I will put it back on "positive review". |
Changed branch from public/28603 to |
In order to make
CombinatorialPolyhedron
more consistent withPolyhedron
, we replaceedge_graph
byvertex_graph
.In case of of unbounded polyhedra this might make a difference, as unbounded 1-faces are considered for
edge_graph
but not forvertex_graph
.For now we keep
edge_graph
and add a deprecation warning.CC: @jplab @LaisRast
Component: geometry
Keywords: polytopes, combinatorial polyhedron
Author: Jonathan Kliem
Branch/Commit:
ecb7986
Reviewer: Laith Rastanawi
Issue created by migration from https://trac.sagemath.org/ticket/28603
The text was updated successfully, but these errors were encountered: