Small question in Bellman-Ford algorithm

[rospara]

Hi William :-)
Good stuff on youtube :-) Thanks.

https://github.com/williamfiset/Algorithms/blob/master/src/main/java/com/williamfiset/algorithms/graphtheory/BellmanFordEdgeList.java

Lines 44-45:
Remarks:

1. First, I've noticed, the comment is incorrect. We do not do relaxation for each "almost" each vertex: "V-1" but we do relaxation
   V - 1 times. Period. So to express it in the code we can iterate over "i" not "v" to show it. Minor issue.
2. Is your optimization with variable 'relaxedAnEdge' always true? It seems to be invalid for me as some paths can not be relaxed, during processing of unordered set of edges (we have set of edges in reality - without specific point of start and algorithm will work anyway) but other, later on, can. What do you thing about that?

robertospara at gmail.com