The following data is noted for the problem Solution is as follows: To begin wit

Question

The following data is noted for the problem

Solution is as follows:

To begin with at node 1 minimum is for node 3 Minimum(240,160)

with node 3 minimum is 140 for node 2 and after inclusion of 2 minimum is 100 for node 4 and so on we get node 5 and lastly node 6 with comulative value of 740

1--3--2--4 (160+140+100=400) 3--5--6(160+180=340) total 740(400+340)

Minimum distance connecting all nodes 1--3--2--4--5--6 is 740 =(160+140+100+160+180)

Branch name Start node End node Distance Branch 1 1 2 240 Branch 2 1 3 160 Branch3 2 3 140 Branch 4 2 4 100 Branch 5 3 4 180 Branch 6 3 5 160 Branch7 4 5 160 Branch 8 4 6 220 Branch9 5 6 180

Explanation / Answer

Back Problem 2 The following table represents a network with the arcs identified by their starting and ending nodes. Arc (from-to) Distance 240 160 140 100 180 160 160 220 180 1-3 2-3 2-4 3-4 4-5 4 -6 5-6 Use the minimal spanning tree method: a) list the nodes that representyour solution (i.e.:1-2, 2-3; etc.]) b) calculate the minimum distance required to connect these nodes

Related Questions

Navigate

• Browse (All)
• Browse T
• Subjects

---

---

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