Let us study how certain implementations and variants of Dijkstra may be used for implementing a BFD round in order to accelerate it. Accordingly, the factor E V log V in the time bound of Theorem 3.5 could be changed to the time bounds of those implementations/variants.