You have to run Prim's algorithm for the problem defined by adjacency matrix: 1 1 0 10 39 29 4 5 6 7 8 9 999 999 17 999 999 999 2 10 0 14 4 2 999 999 13 999 3 9 14 0 4 999 4 7 5 999 2 999 999 9 6 17 999 999 7 999 999 999 70928 999 999 999 999 999 999 2 8 999 999 0 6 999 1 999 6 0 999 7 999 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 1 2 3 4 5 6 7 8 6 nearest 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

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, data-structures-and-algorithms and related others by exploring similar questions and additional content below.