Recently I see this question Bellman Ford and Some Facts as follows:
We know the bellman-ford algorithms check all edges in each step, and for each e
