CombinatorialPolyhedron: edge_graph -> vertex_graph

[kliem]

In order to make CombinatorialPolyhedron more consistent with Polyhedron, we replace edge_graph by vertex_graph.

In case of of unbounded polyhedra this might make a difference, as unbounded 1-faces are considered for edge_graph but not for vertex_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

[kliem]

Description changed:

--- 
+++ 
@@ -1,3 +1,5 @@
 In order to make `CombinatorialPolyhedron` more consistent with `Polyhedron`, we replace `edge_graph` by `vertex_graph`.
 
 In case of of unbounded polyhedra this might make a difference, as unbounded 1-faces are considered for `edge_graph` but not for `vertex_graph`.
+
+For now we keep `edge_graph` and add a deprecation warning.

[kliem]

Branch: public/28603

[kliem]

New commits:

a005e47

added vertex_graph, deprecated edge_graph

[kliem]

Commit: a005e47

[LaisRast]

comment:4

It is good to go.

[LaisRast]

Reviewer: Laith Rastanawi

[sagetrac-git]

Branch pushed to git repo; I updated commit sha1 and set ticket back to needs_review. New commits:

96346fa

improved deprecation warning

[sagetrac-git]

Changed commit from a005e47 to 96346fa