Top
Back: normalFan(polymake)
Forward: vertexEdgeGraph
FastBack: SINGULAR libraries
FastForward: Release Notes
Up: polymake_so
Top: Singular Manual
Contents: Table of Contents
Index: Index
About: About this document

D.16.1.37 vertexAdjacencyGraph

Syntax:
Polymake::vertexAdjacencyGraph( polytope p )
Type:
list
Purpose:
the first entry is a bigintmat containing the vertices, the first row is vertex 0, the second row is vertex one, etc.; the second entry is a list of intvecs, the i-th intvec lists all vertices which are adjacent to the i-1th vertex
Example:
 
  // an octogon
  intmat M[8][3]=
  1,1,2,
  1,2,1,
  1,2,-1,
  1,1,-2,
  1,-1,-2,
  1,-2,-1,
  1,-2,1,
  1,-1,2;
  polytope p=polytopeViaPoints(M);
  list L=vertexAdjacencyGraph(p);

Top Back: normalFan(polymake) Forward: vertexEdgeGraph FastBack: SINGULAR libraries FastForward: Release Notes Up: polymake_so Top: Singular Manual Contents: Table of Contents Index: Index About: About this document
            User manual for Singular version 3-1-7, Aug 2013, generated by texi2html.