Suppose that we have a complete graph with
We want to identify the set of all the paths (acyclic), for example, from 1 to 4:
1->4 etc. Needless to say, for small
n, the paths can be manually identified.
I have a large
n and my graph is not complete. So, the question is: how one can identify all the (acyclic) paths from
t in a directed graph.