title: Detecting All Simple Cycles In Strongly Connected Components(Complexity)
body: <p>I am working with a specific graphical structure representing 2-player normal form games (game theory). I know that I can compute all strongly connected components of the directed graph in O(V+E) via Tarjans, but was wondering what the complexity of computing all of the simple cycles of a strongly connected component is? AND, if there is a known upper bound on the number of such simple cycles given the number of vertices defining the strongly connected component?</p>
  
  <p>I am looking for any literature/algorithms related to both of these problems. THANK YOU!</p>