Bold text

Longest Path Problem is NP Complete

It can be done with dynamic programming ( dp , for short) in O(2 ^ E)

There's no algorithm that is efficient enough.