|
|
D.16.2.38 vertexEdgeGraph
Syntax:
Polymake::vertexEdgeGraph( polytope p )
Type:
- list
Purpose:
- the first entry is a bigintmat containing all vertices as row vectors,
and therefore assigning all vertices an integer.
the second entry is a list of intvecs representing the edge graph of the vertices of p,
each intvec represents an edge of p connecting vertex i with vertex j.
Example:
| | LIB"polymake.lib";
==> Welcome to polymake
==> Copyright (c) 1997-2012
==> Ewgenij Gawrilow, Michael Joswig (TU Darmstadt)
==> http://www.polymake.org
intmat M[6][4] = 1,1,0,0, 1,0,1,0, 1,0,-1,0, 1,0,0,1, 1,0,0,-1, 1,-1,0,0;
polytope p = polytopeViaPoints(M);
list L = Polymake::vertexEdgeGraph(p);
==> polymake: used package cddlib
==> Implementation of the double description method of Motzkin et al.
==> Copyright by Komei Fukuda.
==> http://www.ifor.math.ethz.ch/~fukuda/cdd_home/cdd.html
==>
L;
==> [1]:
==> 1, 0, 0, 1,
==> 1, 1, 0, 0,
==> 1, 0, 1, 0,
==> 1, 0, 0,-1,
==> 1, 0,-1, 0,
==> 1,-1, 0, 0
==> [2]:
==> [1]:
==> 0,1
==> [2]:
==> 0,2
==> [3]:
==> 0,4
==> [4]:
==> 0,5
==> [5]:
==> 1,2
==> [6]:
==> 1,3
==> [7]:
==> 1,4
==> [8]:
==> 2,3
==> [9]:
==> 2,5
==> [10]:
==> 3,4
==> [11]:
==> 3,5
==> [12]:
==> 4,5
|
|
Online Manual
