adjacencyMatrix -- returns adjacency matrix of a directed graph

i1 : I = {a,b,c,d,e};

i2 : C = {(a,b),(b,c),(a,c),(a,d),(d,e)};

i3 : G = directedGraph(I,C);

i4 : P = poset(I,C);

i5 : adjacencyMatrix(G)

o5 = | 0        1        1        1        infinity |
     | infinity 0        1        infinity infinity |
     | infinity infinity 0        infinity infinity |
     | infinity infinity infinity 0        1        |
     | infinity infinity infinity infinity 0        |

                5          5
o5 : Matrix RR    <--- RR
              53         53

i6 : adjacencyMatrix(P)

o6 = | 0        1        1        1        infinity |
     | infinity 0        1        infinity infinity |
     | infinity infinity 0        infinity infinity |
     | infinity infinity infinity 0        1        |
     | infinity infinity infinity infinity 0        |

                5          5
o6 : Matrix RR    <--- RR
              53         53

i7 : adjacencyMatrix(I,C)

o7 = | 0        1        1        1        infinity |
     | infinity 0        1        infinity infinity |
     | infinity infinity 0        infinity infinity |
     | infinity infinity infinity 0        1        |
     | infinity infinity infinity infinity 0        |

                5          5
o7 : Matrix RR    <--- RR
              53         53