title: Finding cycle of 3 nodes ( or triangles) in a graph
body: <p>I am working with complex networks. I want to find group of nodes which forms a cycle of 3 nodes (or triangles) in a given graph. As my graph contains about million edges, using a simple iterative solution (multiple "for" loop) is not very efficient.</p>
  
  <p>I am using python for my programming, if these is some inbuilt modules for handling these problems, please let me know.</p>
  
  <p>If someone knows any algorithm which can be used for finding triangles in graphs, kindly reply back.</p>