title: Longest path in a graph
body: <p>Given a undirected graph with vertices form 0 to n-1, write a function that will find the longest path (by number of edges) which vertices make an increasing sequence.</p>
  
  <p>What kind of approach would you recommend for solving this puzzle? </p>