The state information diffusion illustration is soo good
Dear professor, shouldn't it be {9, infinity, 2} @10:50, for calculating Db(d)? I am a bit confused by why it's {9, 2, infinity}. Thank you for your time and effort for all of these greate videos!
Why does z care about path to x via y when x direct is the min.
9:32 To be in the right order shouldn't Db(d)=min{Cb,a +Da(d), Cb,c + Dc(d), Cb,e + De(d)} = min{9,2,~}=2 ? ~= inf. OOPS LOOKS LIKE SOMEBODY ALREADY NOTED THIS😮
Interesting would love to know what other uses for this algorithm is. But for now networking is great!
I know you haven't made a video in a long time, but if you spare a second, could you explain poisoned reverse? I cannot find you talking about it, and the way you explain things help me immensely in my networking class. Either way, thank you for doing such excellent work!
Dear professor, why are the components in Bellman's formula differently assigned? For example the first element in parentheses -> cost is signed with c and the other cost with D? Thank you
I think there might be an error at the slide on 17:50; seems like 50 should be 5 and the 60 should be 6 despite being spoken as 60?
i am still strugling to understand this..please help
The cost of the computation it's call TOKENs ?
grats on 11k subs!
0:39 - "Bellman-Ford computes the least cost path as a centralized algorithm..." er, you mean "decentralized".
I don't quite get the bad news travels slow issue. Can't you just clear parts of the routing table that'll be affected by the link cost change and do the update from there?
a light year is a unit of distance, confusingly, but i get ya
magnifique!
ðŸ§
Too much overexplaining and repeats himself way to many times
Interesting would love to know what other uses for this algorithm is. But for now networking is great!
@nirmalkarthik5892