I\'m trying to find an efficient algorithm (running time of O(|V|*|E|)) that finds for any graph an order of the edges that allows Bellman-Ford algorithm to run in a single
