Question: 25
(Choose 1 answer)
How can the shortest-path tree be reconstructed after executing Dijkstra's algorithm?
A. By maintaining a 'parent' pointer for each vertex, indicating the predecessor vertex on the shortest path
from the source vertex.
B. By tracing back from the destination vertex to the source vertex using a depth-first search.
C. By iterating through the vertices in the order they were added to the "cloud".
D. The shortest-path tree is implicitly constructed during the algorithm's execution and doesn't require a
separate reconstruction step.
