Fix algorithm provided for finding optimal token amount for Uniswap arbitrage

optimal token

(1) In the case of dfs (depth-first search), bellman ford algorithm is used (2) finding out all strongly connected components as a cycle can only exist in strongly connected components (3) The Bellman-Ford algorithm is applied to the digraph to establish if a negative cycle exists (this implies that there is arbitrage).