A directed graph of a polyhedral set can be generated from its faces, called its face lattice.  The nodes in the graph represent the polyhedral set and all of its faces of all possible dimensions, including the empty set which is trivially a face of polyset.  The edges in the graph represent which face is a subset of which, such as vertex that is a subset of the edge that it bounds.

The graph is organized into rows, where each row contains faces of polyset that have the same dimension.  The top row contains only polyset itself, followed by its facets below, etc.  The nodes are labelled with an identification number that can be used to retrieve that face using PolyhedralSets[Faces] through the faceid option.

The empty set is always included in the graph and labeled as -1, with the other nodes labeled using non-negative integers.

The option output = opts controls the return value of the command.  The default value, output = plot, returns the plot of the graph.  The graph object itself can also be obtained using output = [plot, graph].  The returned graph can be used by the commands of the GraphTheory package.

$\mathrm{with}\left(\mathrm{PolyhedralSets}\right)\:$

$t≔\mathrm{ExampleSets}:-\mathrm{Tetrahedron}\left(\right)\:$$\mathrm{Graph}\left(t\right)$

$c≔\mathrm{ExampleSets}:-\mathrm{Cube}\left(\right)\:$$g,p≔\mathrm{Graph}\left(c\,'\mathrm{output}'=\left['\mathrm{graph}'\,'\mathrm{plot}'\right]\right)\:$$p$

$\mathrm{GraphTheory}\left[\mathrm{Departures}\right]\left(g\,154\right)$

$\left[109\,91\right]$

$f≔\mathrm{Faces}\left(c\,'\mathrm{faceid}'=91\right)$

$f≔\{\begin{array}{lll}\mathrm{Coordinates}& \:& \left[x_1\,x_2\,x_3\right]\\ \mathrm{Relations}& \:& \left[x_3=\mathrm{-1}\,x_2=\mathrm{-1}\,x_1=\mathrm{-1}\right]\end{array}$

The PolyhedralSets[Graph] command was introduced in Maple 2015.

For more information on Maple 2015 changes, see Updates in Maple 2015.