Question

I want to find a circuit in a direct graph , this circuit starts at a specific vertex and ends at it. I use adjacency list data structure to create this graph but I could n’t know how the algorithm would be, please help me.
Thanks a lot

Answer 1

May be this hint will help:

1. traverse graph (any algo – BFS DFS)
2. Color node which you’ve visited
   AND Store its parent
3. check if the node you’re traversing is
   already colored, then loop back to its parents until you get same
   node.