title: Find a triangle in a graph using an algorithm with a specific run time
body: <p>I need to find an algorithm that finds triangular cycles in an undirected graph. The runtime of the algorithm should be n^2,81</p>
  
  <p>I really do not know how I can achieve this. Would be great if anyone could help!</p>
  
  <p>Thanks!</p>