Let G = (V, E, w) be a connected weighted undirected graph.Given a vertex s ∈ V and a shortest path tree Ts withrespect to the source s, design a linear time algorithm forchecking whether the shortest path tree Ts is correct ornot.(C pseudo)
Expert Answer
An answer will be send to you shortly. . . . .