GATE Computer Science (CS) 2011 Solved Paper
Show Para
Question Numbers: 64-65
An undirected graph G(V, E) contains n (n > 2) nodes named ν1, ν2 ν3, ...νn. Two nodes vi,vj are connected if and only if 0 < | i - j | ≤ 2. Each edge (vi,vj) is assigned a weight i + j. A sample graph with n = 4 is shown below.
An undirected graph G(V, E) contains n (n > 2) nodes named ν1, ν2 ν3, ...νn. Two nodes vi,vj are connected if and only if 0 < | i - j | ≤ 2. Each edge (vi,vj) is assigned a weight i + j. A sample graph with n = 4 is shown below.
© examsiri.com
Question : 65 of 65
Marks:
+1,
-0
The length of the path from ν5 to ν6 in the MST of previous question with n = 10 is
Go to Question: