Shortest path between two subsets.Given a digraph with positive edge weights, and two distinguished subsets of vertices Sand T,find a shortest path from any vertex in Sto any vertex in T. Your algorithm should run in time proportional to Elog V, in the worst case.
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.