Wrong complexity for Dinics

https://github.com/williamfiset/Algorithms/blob/da50861a53fc2f6642cfc7d82c285166f41d03e2/src/main/java/com/williamfiset/algorithms/graphtheory/networkflow/Dinics.java#L9C1-L9C1

Hey, I think the actual time complexity for Dinics algorithm is O(E^2V), not O(EV^2) as written.

Is the implementation non-optimal or is the comment simply wrong?