Network Problems

Today in class we learned how to solve network problems with Matrices. The textbook examples can be found on page 72. The work that was assigned can be found on page 76, numbers 1-6. The example used in the text book was as follows:

y=YellowKnife
I=Inuvik
NW=Norman Wells
RI=Rankin Inlet
W=Whitehorse


Y I NW RI W Y I NW RI W
y 0 1 1 1 1 o 1 1 1 1
I 1 0 1 0 0 = A= 1 0 1 0 0
NW 1 1 0 0 0 1 1 0 0 0
RI 1 0 0 0 0 1 0 0 0 0
W 1 0 0 0 0 1 0 0 0 0

*You can travel directly from Inuvik to Norman Wells, but you have to go through Yellowknife to get from Norman Wells to Rankin Inlet.

*This network can be summerized in a table or matrix. An entry of 1 indicates that direct travel from a given city to another is possible. The entry 0 indicates that direct travel from a given city to another is not possible. The order in which the cities are listed in the matirx does not matter as long as the order is the same vertically and horizontally.