I need help in enumerating all available simple paths in a directed graph. I am using quickgraph library. Is there a specific algorithm that would enumerate all paths in a digraph? I will use it to create a decoder for a machine translation and have tried DFS and BFS but it seems it only generates one path.
I am thinking of using DFS in beam search exploration but i cant grasp the idea and the algorithm to enumerate all simple paths.
Using C# programming language..
This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)