Then what we're going to do is we're going to run through all the pairs of nodes in the graph i, n, j, and for each one if it's not on the very edge, we're going to make a link-- well, if it's not on the bottom edge, then we're going to make a link downward. 