Suppose that after we run Dijkstra's algorithm on an undirected graph starting from vertex 0, we...

 

Transcribed Image Text:

Suppose that after we run Dijkstra's algorithm on an undirected graph starting from vertex 0, we obtain the following dist and pred arrays: 0 1 2 3 4 5 6 7 dist pred 0 5 2 8 14 6 13 6 0 0 1 3 1 5 2 Which of the following would we be able to correctly deduce based on these arrays? Select all that apply. (a) The shortest distance from 3 to 5 (b) The shortest distance from 0 to 4 (c) The shortest distance from 1 to 6 (d) The shortest distance from 6 to 2 (e) The shortest distance from 7 to 0 Suppose that after we run Dijkstra's algorithm on an undirected graph starting from vertex 0, we obtain the following dist and pred arrays: 0 1 2 3 4 5 6 7 dist pred 0 5 2 8 14 6 13 6 0 0 1 3 1 5 2 Which of the following would we be able to correctly deduce based on these arrays? Select all that apply. (a) The shortest distance from 3 to 5 (b) The shortest distance from 0 to 4 (c) The shortest distance from 1 to 6 (d) The shortest distance from 6 to 2 (e) The shortest distance from 7 to 0