quickgraph directed graph enumerate all simple path

Question

1.00/5 (1 vote)

See more:

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..

Posted 7-Jan-13 3:21am

lore jairus

Updated 7-Jan-13 3:22am

v2

Add a Solution

Comments

Sergey Alexandrovich Kryukov 7-Jan-13 18:37pm

You will improve you chances for a good advice if you tag language and platform. Your tag "path" is not informative.
And provide a link to "quickgraph". What is it? why using it? Ever considered writing code by yourself..?
—SA

1 solution

Add a Solution

This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

Sergey Alexandrovich Kryukov · Answer 1 · 2013-01-07T12:45:00

Solution 1

One of the answers to this questions describes the algorithm: http://stackoverflow.com/questions/1830607/complexity-of-finding-all-simple-paths-using-depth-first-search[^].

You can find a lot more, just Google for it. This topic is quite popular.

—SA

Posted 7-Jan-13 12:45pm

Sergey Alexandrovich Kryukov

quickgraph directed graph enumerate all simple path

1 solution

Solution 1

Add your solution here

Preview 0

quickgraph directed graph enumerate all simple path

1 solution

Solution 1

Add your solution here

Preview 0

Existing Members

...or Join us