A bit of refactoring and starting a new problem
Done the problem except the Bellman-Ford algorithm
Finished, this time the graph is saves as a trio where (startingNode,
EndNode, profit*(-1)). The profits are saved in negative because
bellman-ford is for minimum paths, and we are looking for maximum
profit.