Prove that for the array p r e v computed by Dijkstra’s algorithm, the edges {u, p r e v[u]} (for all u ϵ V) form a tree.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.