You are given a directed graph G = (V, E) with (possibly negative) weighted edges, along with a specific node s ∈ V and a tree T = (V, E′), E′ ⊆ E. Give an algorithm that checks whether T is a shortest-path tree for G with starting point s. Your algorithm should run in linear time.
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.