You have to run Prim's algorithm for the problem defined by adjacency matrix: 1 2 3 4 5 6 7 8 9 1 0 10 9 999 999 17 999 999 999 2 10 3. 9 11 14 4 2 999 999 13 999 14 0 7 999 999 999 999 999 4 999 4 7 0 999 2 8 999 999 567 999 2 999 999 0 6 999 1 999 17 999 999 2 6 0 999 7 999 999 999 999 8 999 999 0 11 4 8 999 13 999 999 1 7 11 0 8 9 999 999 999 999 999 999 4 8 0 1. We started from the vertex vl, so initially we have Y = {v1}: initial nearest 1 2 3 4 5 6 7 8 9 1 1 1 1 1 1 1 1 1 distance -1 10 9 999 999 17 999 999 999 Print out the values stored in the nearest and distance arrays after first iteration of Prim's algorithm. Specify the value of vnear and the next vertex that has to be added to Y Hint: use (copy) the table above to record your answer.
You have to run Prim's algorithm for the problem defined by adjacency matrix: 1 2 3 4 5 6 7 8 9 1 0 10 9 999 999 17 999 999 999 2 10 3. 9 11 14 4 2 999 999 13 999 14 0 7 999 999 999 999 999 4 999 4 7 0 999 2 8 999 999 567 999 2 999 999 0 6 999 1 999 17 999 999 2 6 0 999 7 999 999 999 999 8 999 999 0 11 4 8 999 13 999 999 1 7 11 0 8 9 999 999 999 999 999 999 4 8 0 1. We started from the vertex vl, so initially we have Y = {v1}: initial nearest 1 2 3 4 5 6 7 8 9 1 1 1 1 1 1 1 1 1 distance -1 10 9 999 999 17 999 999 999 Print out the values stored in the nearest and distance arrays after first iteration of Prim's algorithm. Specify the value of vnear and the next vertex that has to be added to Y Hint: use (copy) the table above to record your answer.
Chapter3: Data Representation
Section: Chapter Questions
Problem 28VE
Related questions
Question
Transcribed Image Text:You have to run Prim's algorithm for the problem defined by adjacency matrix:
1
2
3
4
5
6
7
8
9
1
0
10
9
999
999
17
999
999 999
2
10
10
3
9
11
0
14
4
2
999
999 13
999
14
0
7
999
999
999
999
999
4
999
4
7
0
999
2
8
999
999
567
999 2
999
999
0
6
999
1
999
17
999
999
2
6
0
999
7
999
999 999
999 8 999 999
0
11
4
8
999 13
999
999
1
7
11
0
8
9
999 999 999 999
999 999
4
8
0
1. We started from the vertex vl, so initially we have Y = {v1}:
initial
nearest
1
2
3
4
5
6
7
8
9
16
1
1
1
1
1
1
1
1
distance
-1
10
9
999
999
17
999
999
999
Print out the values stored in the nearest and distance arrays after first iteration of Prim's algorithm. Specify
the value of vnear and the next vertex that has to be added to Y
Hint: use (copy) the table above to record your answer.
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 3 steps
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Recommended textbooks for you
Systems Architecture
Computer Science
ISBN:
9781305080195
Author:
Stephen D. Burd
Publisher:
Cengage Learning
Systems Architecture
Computer Science
ISBN:
9781305080195
Author:
Stephen D. Burd
Publisher:
Cengage Learning