Академический Документы
Профессиональный Документы
Культура Документы
the code
-In global-route-manager-impl.cc class that compute Dijkstra
Algorithm, in function SPFNext
When we are applying the formula in Dijkstra algorithm
(D(V) = min { D(v) , D(W)+C(V,W) })
The case when D(v) = D(W)+C(V,W) resulted in a new path in the
dijkstra algorithm. Eventually it will be least cost path as well as
the current path. That resulted in multiple paths to the same
destination.
What we did was to remove that if condition. From line (920 to
951).
Run samples
The output using terminal