Thanks in advance...looking for recommendations on an algorithm to find all paths of length n starting from a single node in a directed, cyclic graph.
I am not concerned with at which node the path completes. i.e. not looking to travel from i to j in a path of a certain length. I would like to start from i and end ultimately with an enumeration of all unique paths emanating from i of length n. These unique paths may or may not contain cycles.
