Pearlsburg Rescue Squad Case
1. Draw a network diagram for this problem.
a. Label all nodes appropriately with either numbers or town names. Note: if you use numbers, please provide a mapping guide to equate your numbers to towns.
b. Mark the diagram with actual times on the branches.
c. Draw diagram so that no paths cross.
d. This is a complete diagram that will be used as the initial step in part 2. Everything must be shown/labeled on this initial diagram-all paths and all nodes.
2. Find the shortest route solution to each network node.
a. You must show your work on this part - just like we did in the class examples. You will need more than just the final diagram/network with final timings.
b. Create and populate a matrix/spreadsheet that has two columns:
i) Network path
ii) Total time for that path
Attachment:- SKMBT-C45212031909340.pdf