Complete this network problem on paper and then answer the Quiz 3 questions (loc

Question

Complete this network problem on paper and then answer the Quiz 3 questions (located under the Assignments tab) posted to the course website on Canvas (will be posted soon). You may want to first review the questions on the course website on Canvas, then work the problems on paper to make sure you have the correct answer. Shortest Route Problem. For the network shown below, determine the shortest route from node 1 to each of the other six nodes (nodes 2 through 7). Distances between nodes are given in miles. Complete the table at the bottom of this sheet.

Explanation / Answer

applying krusk algorithm to find shortest paths ,

node 1 to 2 : 1-3-4-2 = 39

node 1 to 3 : 1-3 = 17

node 1 to 4 : 1-3 , 3-4 = 29

node 1 to 5 : 1-3 , 3-4 , 4-7, 7-5 = 50

node 1 to 6 : 1-3,3-4,4-7,7-6 =53

node 1 to 7 : 1-3,3-4,4-7, = 38

due to kruskal sometimes we are getting shortest route and sometime a longer route

Related Questions

Navigate

• Browse (All)
• Browse C
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.