The command AdjacencyList(P) returns an adjacency list representation of the partially ordered set P.

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

$V≔\varnothing \&colon;$$\mathrm{leq}≔\mathrm{`<=`}\&colon;$$\mathrm{empty\_poset}≔\mathrm{PartiallyOrderedSet}\left(V\&comma;\mathrm{leq}\right)$

$\mathrm{empty\_poset}≔\mathrm{<\; a\; poset\; with\; 0\; elements\; >}$

$\mathrm{AdjacencyList}\left(\mathrm{empty\_poset}\right)$

$S≔\left\{1\&comma;2\&comma;3\&comma;4\&comma;5\right\}\&colon;$$\mathrm{poset1}≔\mathrm{PartiallyOrderedSet}\left(S\&comma;\mathrm{leq}\right)$

$\mathrm{poset1}≔\mathrm{<\; a\; poset\; with\; 5\; elements\; >}$

$\mathrm{DrawGraph}\left(\mathrm{poset1}\right)$

$\mathrm{AdjacencyList}\left(\mathrm{poset1}\right)$

$\left[\begin{array}{ccccc}\left\{1\&comma;2\right\}& \left\{2\&comma;3\right\}& \left\{3\&comma;4\right\}& \left\{4\&comma;5\right\}& \left\{5\right\}\end{array}\right]$

$\mathrm{lneq}≔\mathrm{`<`}\&colon;$$\mathrm{poset1\_1}≔\mathrm{PartiallyOrderedSet}\left(S\&comma;\mathrm{lneq}\right)$

$\mathrm{poset1\_1}≔\mathrm{<\; a\; poset\; with\; 5\; elements\; >}$

$\mathrm{DrawGraph}\left(\mathrm{poset1\_1}\right)$

$\mathrm{AdjacencyList}\left(\mathrm{poset1\_1}\right)$

$\left[\begin{array}{ccccc}\left\{1\&comma;2\right\}& \left\{2\&comma;3\right\}& \left\{3\&comma;4\right\}& \left\{4\&comma;5\right\}& \left\{5\right\}\end{array}\right]$

$\mathrm{divisibility}≔\left(x\&comma;y\right)\mapsto \mathrm{irem}\left(y\&comma;x\right)=0\&colon;$$T≔\left\{3\&comma;4\&comma;5\&comma;6\&comma;7\&comma;8\&comma;9\right\}\&colon;$

$\mathrm{poset2}≔\mathrm{PartiallyOrderedSet}\left(T\&comma;\mathrm{divisibility}\right)$

$\mathrm{poset2}≔\mathrm{<\; a\; poset\; with\; 7\; elements\; >}$

$\mathrm{DrawGraph}\left(\mathrm{poset2}\right)$

$\mathrm{AdjacencyList}\left(\mathrm{poset2}\right)$

$\left[\begin{array}{ccccccc}\left\{3\&comma;6\&comma;9\right\}& \left\{4\&comma;8\right\}& \left\{5\right\}& \left\{6\right\}& \left\{7\right\}& \left\{8\right\}& \left\{9\right\}\end{array}\right]$

$\mathrm{divisibNE}≔\left(x\&comma;y\right)\mapsto \mathrm{irem}\left(y\&comma;x\right)=0\mathbf{and}y\ne x\&colon;$

$\mathrm{poset2\_1}≔\mathrm{PartiallyOrderedSet}\left(T\&comma;\mathrm{divisibNE}\&comma;\mathrm{reflexive}=\mathrm{checkfalse}\right)$

$\mathrm{poset2\_1}≔\mathrm{<\; a\; poset\; with\; 7\; elements\; >}$

$\mathrm{DrawGraph}\left(\mathrm{poset2\_1}\right)$

$\mathrm{AdjacencyList}\left(\mathrm{poset2\_1}\right)$

$\left[\begin{array}{ccccccc}\left\{3\&comma;6\&comma;9\right\}& \left\{4\&comma;8\right\}& \left\{5\right\}& \left\{6\right\}& \left\{7\right\}& \left\{8\right\}& \left\{9\right\}\end{array}\right]$

$\mathrm{adjList5}≔\mathrm{map2}\left(\mathrm{map}\&comma;\mathrm{`+`}\&comma;\mathrm{Array}\left(\left[\left\{1\&comma;4\&comma;7\right\}\&comma;\left\{2\&comma;6\right\}\&comma;\left\{3\right\}\&comma;\left\{4\right\}\&comma;\left\{5\right\}\&comma;\left\{6\right\}\&comma;\left\{7\right\}\right]\right)\&comma;2\right)$

$\mathrm{adjList5}≔\left[\begin{array}{ccccccc}\left\{3\&comma;6\&comma;9\right\}& \left\{4\&comma;8\right\}& \left\{5\right\}& \left\{6\right\}& \left\{7\right\}& \left\{8\right\}& \left\{9\right\}\end{array}\right]$

$\mathrm{poset5}≔\mathrm{PartiallyOrderedSet}\left(\mathrm{convert}\left(T\&comma;'\mathrm{list}'\right)\&comma;\mathrm{adjList5}\right)$

$\mathrm{poset5}≔\mathrm{<\; a\; poset\; with\; 7\; elements\; >}$

$\mathrm{DrawGraph}\left(\mathrm{poset5}\right)$

$\mathrm{AdjacencyList}\left(\mathrm{poset5}\right)$

$\left[\begin{array}{ccccccc}\left\{3\&comma;6\&comma;9\right\}& \left\{4\&comma;8\right\}& \left\{5\right\}& \left\{6\right\}& \left\{7\right\}& \left\{8\right\}& \left\{9\right\}\end{array}\right]$

$G≔\mathrm{GraphTheory}:-\mathrm{Graph}\left(\mathrm{directed}\&comma;\left[1\&comma;2\&comma;3\&comma;4\&comma;5\&comma;6\right]\&comma;\left\{\left[1\&comma;1\right]\&comma;\left[1\&comma;2\right]\&comma;\left[1\&comma;3\right]\&comma;\left[1\&comma;4\right]\&comma;\left[1\&comma;5\right]\&comma;\left[1\&comma;6\right]\&comma;\left[2\&comma;2\right]\&comma;\left[2\&comma;4\right]\&comma;\left[2\&comma;6\right]\&comma;\left[3\&comma;3\right]\&comma;\left[3\&comma;5\right]\&comma;\left[3\&comma;6\right]\&comma;\left[4\&comma;4\right]\&comma;\left[4\&comma;6\right]\&comma;\left[5\&comma;5\right]\&comma;\left[5\&comma;6\right]\&comma;\left[6\&comma;6\right]\right\}\right)$

$G≔\mathrm{Graph\; 1:\; a\; directed\; graph\; with\; 6\; vertices,\; 11\; arcs,\; and\; 6\; self-loops}$

$\mathrm{poset6}≔\mathrm{PartiallyOrderedSet}\left(G\right)$

$\mathrm{poset6}≔\mathrm{<\; a\; poset\; with\; 6\; elements\; >}$

$\mathrm{DrawGraph}\left(\mathrm{poset6}\right)$

$\mathrm{AdjacencyList}\left(\mathrm{poset6}\right)$

$\left[\begin{array}{cccccc}\left\{1\&comma;2\&comma;3\right\}& \left\{2\&comma;4\right\}& \left\{3\&comma;5\right\}& \left\{4\&comma;6\right\}& \left\{5\&comma;6\right\}& \left\{6\right\}\end{array}\right]$

$t≔\mathrm{PolyhedralSets}:-\mathrm{ExampleSets}:-\mathrm{Octahedron}\left(\right)$

$t≔\&lcub;\begin{array}{lll}\mathrm{Coordinates}& \&colon;& \left[x_1\&comma;x_2\&comma;x_3\right]\\ \mathrm{Relations}& \&colon;& \left[-x_1-x_2-x_3\le 1\&comma;-x_1-x_2+x_3\le 1\&comma;-x_1+x_2-x_3\le 1\&comma;-x_1+x_2+x_3\le 1\&comma;x_1-x_2-x_3\le 1\&comma;x_1-x_2+x_3\le 1\&comma;x_1+x_2-x_3\le 1\&comma;x_1+x_2+x_3\le 1\right]\end{array}$

$d≔\mathrm{PolyhedralSets}:-\mathrm{Dimension}\left(t\right)$

$d≔3$

$\mathrm{t\_faces}≔\left\{\mathrm{seq}\left(\mathrm{op}\left(\mathrm{PolyhedralSets}:-\mathrm{Faces}\left(t\&comma;\mathrm{dimension}=i\right)\right)\&comma;i=-0..d\right)\right\}\&colon;$

$\mathrm{t\_faces}≔\mathrm{t\_faces}\mathbf{union}\left\{\mathrm{PolyhedralSets}:-\mathrm{ExampleSets}:-\mathrm{EmptySet}\left(d\right)\right\}\&colon;$

$\mathrm{FL}≔\mathrm{convert}\left(\mathrm{t\_faces}\&comma;\mathrm{list}\right)\&colon;$

inclusion := proc(x,y) PolyhedralSets:-`subset`(FL[x],FL[y]) end proc:

$\mathrm{polyhedral\_poset}≔\mathrm{PartiallyOrderedSet}\left(\left\{\mathrm{seq}\left(i\&comma;i=1..\mathrm{nops}\left(\mathrm{FL}\right)\right)\right\}\&comma;\mathrm{inclusion}\right)$

$\mathrm{polyhedral\_poset}≔\mathrm{<\; a\; poset\; with\; 28\; elements\; >}$

$\mathrm{DrawGraph}\left(\mathrm{polyhedral\_poset}\right)$

$\mathrm{AdjacencyList}\left(\mathrm{polyhedral\_poset}\right)$

$\left[\begin{array}{cccccccccccccccccccccccccccc}\left\{4\&comma;10\&comma;15\&comma;19\&comma;21\&comma;22\&comma;28\right\}& \left\{7\&comma;8\&comma;10\&comma;11\&comma;13\right\}& \left\{5\&comma;8\&comma;15\&comma;17\&comma;24\right\}& \left\{17\&comma;19\&comma;20\&comma;23\&comma;25\right\}& \left\{11\&comma;16\&comma;21\&comma;23\&comma;27\right\}& \left\{13\&comma;16\&comma;22\&comma;24\&comma;25\right\}& \left\{5\&comma;7\&comma;20\&comma;27\&comma;28\right\}& \left\{3\&comma;5\&comma;14\right\}& \left\{7\&comma;9\&comma;14\right\}& \left\{8\&comma;12\&comma;14\right\}& \left\{6\&comma;9\&comma;11\right\}& \left\{6\&comma;12\&comma;13\right\}& \left\{6\&comma;16\&comma;18\right\}& \left\{2\&comma;3\&comma;17\right\}& \left\{1\&comma;3\&comma;20\right\}& \left\{1\&comma;18\&comma;23\right\}& \left\{2\&comma;12\&comma;24\right\}& \left\{2\&comma;18\&comma;25\right\}& \left\{1\&comma;9\&comma;27\right\}& \left\{1\&comma;26\right\}& \left\{2\&comma;26\right\}& \left\{3\&comma;26\right\}& \left\{6\&comma;26\right\}& \left\{9\&comma;26\right\}& \left\{12\&comma;26\right\}& \left\{14\&comma;26\right\}& \left\{18\&comma;26\right\}& \left\{26\right\}\end{array}\right]$

Richard P. Stanley: Enumerative Combinatorics 1. 1997, Cambridge Studies in Advanced Mathematics. Vol. 49. Cambridge University Press.

The PartiallyOrderedSets[AdjacencyList] command was introduced in Maple 2025.

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