ke in the picture.
         </p>
         <p>One funny property is that A(2,1) = 1 too!  So we actually have to store each edge twice in the adjacency matrix.  This might
            seem wasteful, but its hard to avoid as I've learned while working on graph algorithms.  So don't worry about it!  It also
            makes the generalization to directed graphs (below) easy.
         </p>
         <p>For more information about the adjacency matrix representation of a graph, see a standard book on graph algori