Adjacency Matrices (Networks)
Below are some resources that I hope to be helpful. I HIGHLY recommend that when you're working on network problems (also known as adjacency matrices) that you answer the problem for yourself on scratch paper (creating your OWN diagram) BEFORE you look at the answer options. For me personally, the answer options are all very similar and it's easy to overlook details. That's why I like to draw my own and then compare the options to see which one matches my own. Remember that the arrows indicate relationships. For example, in the diagram to the left, I can tell that:
J goes to J (notice this is the only one that loops back to itself)
J goes to L
K goes to J
K goes to M
L goes to K
M goes to L
M goes to K
M goes to J
J goes to J (notice this is the only one that loops back to itself)
J goes to L
K goes to J
K goes to M
L goes to K
M goes to L
M goes to K
M goes to J
People in the travel industry especially use these types of matrices. For example, if each letter represented a different airport, I could tell from looking at the matrix that the only way to get to M is through K. So if a passenger is in city L, they'd have to fly to K and then fly to M. If a person is leaving M, they can fly anywhere they want in one flight.
Adjacency Matrix (Networks), Additional Resources:
1) Explanation and example: http://mathworld.wolfram.com/AdjacencyMatrix.html
2) Good explanation: http://faculty.ucr.edu/~hanneman/nettext/C5_%20Matrices.html
3) Video: http://www.youtube.com/watch?v=fMuTwUYhxeY
Adjacency Matrix (Networks), Additional Resources:
1) Explanation and example: http://mathworld.wolfram.com/AdjacencyMatrix.html
2) Good explanation: http://faculty.ucr.edu/~hanneman/nettext/C5_%20Matrices.html
3) Video: http://www.youtube.com/watch?v=fMuTwUYhxeY