title: Count number of cycles in directed graph using DFS
body: <p>I want to count total number of directed cycles available in a directed graph (Only count is required). </p>
  
  <p>You can assume graph is given as adjacency matrix. </p>
  
  <p>I know <code>DFS</code> but could not make a working algorithm for this problem. </p>
  
  <p>Please provide some pseudo code using <code>DFS</code>.</p>