Dijkstra's algorithm solves what kind of problem for a O Single-destination longest path. O Single-destination shortest path. O Single-source longest path.

Using given matrix P produced by Floyd2 Algorithm restore the path from v9 to V2 that has the minimum cost (shortest path). Hint: use path(r, q) function. P v1 "2 V3 v4 V5 V6 V7 8 90 19 v1 0 6 5 0 0 9 22 0 0 5 0 1 0 6 6 9 5 0 6 V3 6 9 0 6 9 9 9 9 0 v4 0 0 5 0 0 15 0 9 0 9 0 9 0 6 6 9 7 5 4. 3 0. 9 8 9 8 V6 17 18 19 8 8 0 0 2 7 8 5 0 1 0 0 9 0 8 0 8 8 0 9 8 0 0 8 9 0 3 0 6 7 0

Describe an efficient algorithm for finding a maximum spanning tree in G, which would maximize the bandwidth between two switching centers. Describe the problem in terms of input and expected output clearly. Develop a program that accepts a network G of switching centers and the bandwidth between them (not all are connected directly with each other) and two switching centers a and b; it will output the maximum bandwidth between any two switches a and b. Please give solution in Java/C/Python language

PLEASE answer ASAP I will give upvotes if you answer as soon as possible This is Iterative Improvement