Question

(Graph Theory)
A road network will be built that connects seven cities, K1, K2, K3, K4, K5, K6 and K7. The cost of building a direct road connecting the city of Ki, and the city of Kj, is the number in the table located in the i-th row and j-th column. Make a road network so that people in one city can travel to another city through the road network that will be built and the minimum construction cost.

w o NA - NII A N-owi Not o v Nw I want No 1. wat A Įvor Not IANNA Wt

Answer 1

Page No.: - Как kuks Ka- ГЧ 2 5 37 3 6 12 ч - 3 2 2 5 оро s - 2 2 2 - | 5 2 9 7 We will use floyed Warshall Algorithm The FIN A is for solving All paiss shortest Path problems. The problem is to find shortest distance between every pair of rentices in a geren edge weights directed graph. K, as intermediate vertex. t, K, K, K, K, K, 2. 1 ч 2 5 3 7 3 0 1 2 ч - 3 2 с ч 2 - 6 и 2 - ч ч - о 6 ч 7 ч ч 2 5 А" ( д°C, , ,1 1A" (к), К.7 3 - 2 + . д° (и, и 1 . A® (к, , 4,1 1A° С, к] € 2 + ч в"(, , ,1 k(К., KJ *(, , 41 ( 2 + 2 — "Patience is a key element of success. - Gates

Date - Page No.: - а (k, 4.1. А" (us, kilt A(x1, д.] / А” (ху , и. e" [kg 1 p" (1, к.] Kr as uite mediati veeten г. А2 2 2 - 1 ч 2 ч 2 ) 3 6 12 ч 3 2 5 ч 2 - 6 S ч 6. 54 2 5 3 ч ч ' (K, , , Jasn' (u, k] 0 2 3 5 - 9 ок, А" Си, к.1 . - | г' би и 1 е' [и, и, 1 ча" (ка и, Ark, к1 A'lis , и,ЈА ( 4 , 1 1 1 3 4 2 ди, и, ка" | , « ТА! (К., K4T 2 К 2 + 4 - WTI ну, к, К «Т, К) - «' [4, , , , "There are no great things, only small things w S cnly all this with great love, Happy are the Mother Teresa

Dato - Page No.: Uz as intermediate reetex и , К4 kus u, , отч 2 ч , 2 - . . . . . . 1 2 3 - 3 2 5 24 x 2 – 5 а ч 1 2 1 1 2 5 - 3 5 ч , 2. Б В 3 - 4 9 ч. 9 2 . 5 ч се А* (К., , ,] . А? (u, us] - «Сия, u] е т 2 — к y as intermediate и, т цуг - ч, 2 3 , | , , Ч , ч , 3 о с 21 " - 3. 3 2 5 ч – 3 5 k, ч ұ, 2 К. ч , 32 А 3. 9 5 5 9 ч ч. 3 Patience et of S B Gates

Date - Page No.: , к т 3 - 3 2 б ч им кg kе ka ч 2 ч 3 ) 6 1 2 ч 3 2 5 ч 4 5 6 Ч 5 - 25 в 3 - у 5 ч . 1 2 м, ки LG , , Ти 2 ч 31 1 - 3 2 . 5 4 3 - 5 5 и 2 5 - 3 5 г 8 3 - ч ч ч 5 ч — ч 2 9 и there are shortest fath taking every weetex.