Question

A transportation network has 10 nodes. Distances of roads between nodes are shown in Table 1. Total five emergency vehicles are located at nodes 2,4, 5, 7, and 9. There is one vehicle at each of these five nodes. The vehicles must travel to destination nodes 1, 3, 6, 8 and 10. Each destination node will have one vehicle. Suppose that emergency vehicles may travel along both directions of any road shown in Table 1. Please apply the Dijkstra's algorithm and Hungaria n method to minimize the total travel distance of the five vehicles. Table 1. Distances of Roads between Nodes in a Transportation Network. Road Distance 43 23 17 43 16 18 1 10 35 2 10 16 27 16 17 47 23 24 46 28 15 37 4 10 5 10 38 38 7 10 8 10 23 45 15

Answer 1

Ugin int V, no . or vertice, ixt. 〈 ínt> * adu ג // poǐ사니 ad J Ả 자.cint s ema

ん) to Lase Case Vigixe3: troe it <oil! e Ued

ele connoe do BF.S

int main Geaf e a gr @h T'm n tte above dia7"om iven eige UV eise