Force search to start arbitrarily at node 0 because the starting point of a cycle can be arbitrary
Implement BellmanHeldKarp dynamic programming algorithm (only distance portion for now)