There are many variants of Rudrata’s problem, depending on whether the graph is undirected or directed, and whether a cycle or path is sought. Reduce the DIRECTED RUDRATA PATH problem to each of the following.
(a) The (undirected) RUDRATA PATH problem.
(b) The undirected RUDRATA (s, t)-PATH problem, which is just like RUDRATA PATH except that the endpoints of the path are specified in the input.
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.