<p>Efficient Algorithms are already known in the literature.</p>

<p>See e.g., </p>

<ul>
<li><p>Tarjan, R E and Read, R C (1975) Bounds on backtrack algorithms for listing cycles, paths, and spanning trees. Networks 5(3):237-252</p></li>
<li><p>Johnson, D. B. (1975) Finding All the Elementary Circuits of a Directed Graph. SIAM Journal on Computing 4(1):77-84. </p></li>
</ul>

CC BY-SA 3.0
2015-06-29T12:54:31.950Z
2015-06-29T12:54:31.950Z
XORwell
<p>I have a strongly connected component with over 200 vertices and more than 600 edges. I need to iterate through each simple cycle in the graph exhaustively, without specifying a particular node. Is there any efficient algorithm to perform this operation?</p>

<graph-theory><graph-algorithms>
Finding all possible simple cyclic paths in a digraph
Sreeja
# Finding all possible simple cyclic paths in a digraph

(Asked by: username_0 on 2015-06-29)

I have a strongly connected component with over 200 vertices and more than 600 edges. I need to iterate through each simple cycle in the graph exhaustively, without specifying a particular node. Is there any efficient algorithm to perform this operation?

**Tags:** graph-theory, graph-algorithms


---

## 1 answers

### Answer by username_1 on 2015-06-29. Score: 2 | Accepted answer

Efficient Algorithms are already known in the literature.

See e.g.,

* Tarjan, R E and Read, R C (1975) Bounds on backtrack algorithms for listing cycles, paths, and spanning trees. Networks 5(3):237-252
* Johnson, D. B. (1975) Finding All the Elementary Circuits of a Directed Graph. SIAM Journal on Computing 4(1):77-84.


---

