title: Using Strongly Connected Components Algo as Cycle Detection
body: <p>I understand that if a set of vertices are part of strongly connected components, then all those vertices within the component can reach one another; a cycle.  </p>
  
  <p>Now, I would like to use this fact and claim that if a graph G = (V,E) has a cycle, then that cycle MUST BE inside scc.  </p>
  
  <p>In other words, all cycles must be part of scc (my claim). </p>
  
  <p>I cant think of any counterexample to my claim, so I would like to know if there are any cycles in a graph that are not part of scc.<br>
  Or
  Is my claim, correct? </p>