How I get all the paths at two points in a Directed Graph which has circles

Question

I can get all paths by using DFS if the graph like this:

The path is D-C-B-A and D-E-A But the progame go into a loop if the grapg like this:

I need some examples or pseudocode to deal with grapg which has circles.

If anyone needs the source code of DFS in plsql programming language(It is not beautiful)，please leave a message.

Thanks!

Do you maintain a list of visited nodes ? – c0der Sep 14 '21 at 04:16 — c0der, Sep 14 '21 at 04:16

score 0 · Answer 1 · answered Sep 23 '21 at 02:16

I have solved the problem。 Here is the pseudocode

function dfs(start_obj,end_obj,stack,d)
{
  d=d+1;
 stack.push(start_obj);
  visited(start_obj)=true;
  if (start_obj==end_obj){
       #print the path in stack     
       }

  p:=get_first_starc(start_obj); #get the first vertex
  while(p){
  w=p;
  if (visited(start_obj))
    { 
      dfs(start_obj,end_obj,stack,d)
      }
  p=get_next_starc(start_obj)

  }
stack.pop();
 

}

How I get all the paths at two points in a Directed Graph which has circles

1 Answers1