title: How to find the longest simple path in a graph?
body: <p>I know that for non-directed graph this problem is NP-complete hence we should do Brute Force in order to check all possible paths. How we can do that? Please suggest a pseudo code and tell me the complexity of that algorithm.</p>
  
  <p>If there are optimizations, then that would be awesome!</p>