In linear algebra, we are now learning about digraphs and I am somewhat confused as to how we can obtain and use these. How do adjacency matrices for digraphs work? If given that a31 is a certain number (ex. a31 = 2), how could you tell which pathways account for it? Also, if the adjacency matrix has rows ABCD and columns ABCD, how would one tell in how many transitions information travels from B to all of the others? Thanks. I really need help in understanding this.