It is from Bellman, Held and Karp [0] and has O*(2^n) complexity for both space and time. It is quite simple and based on the idea that "Every subpath of a pat

It is from Bellman, Held and Karp [0] and has O*(2^n) complexity for both space and time. It is quite simple and based on the idea that "Every subpath of a path of minimum distance is itself of minimum distance." [0] https://en.wikipedia.org/wiki/Held%E2%80%93Karp_algorithm https://en.wikipedia.org/wiki/Held%E2%80%93Karp_algorithm