Does every graph have an order of the edges such that after running a single iteration of Bellman-Ford algorithm according to this order, every vertex is labeled with it's shortest path to the source ?
i'm quiet sure that the answer is yes, but i can't think of an Algorithm that is able to find the order of edges, thanks =]
Sort a shortest path tree topologically.