Find whether exists a path from u to v or viceversa
I have to check, in a directed graph, whether exists a path from u to v or
from v to u (being u, v any two vertex of the graph). It's related to
strongly connected components. The algorithm must be O(|V||E|).
Any suggestion or hint to find the solution? I have no idea how can I
start to work.
Thanks in advance!
No comments:
Post a Comment