M46 Bellman Ford Algm single source

[@vinguyenkhanh199]

Indian lecturers always give me hope in my study

[@eLearningBihar]

Thanks

[@souravpaul7451]

very detailed explanation , helped a lot in my project
Thank U Sir
💐

[@phishyp]

Awesome! Super easy to understand when going by path length for each iteration. Thank you for this explanation.

[@eLearningBihar]

Thanks

[@bhaktiarandolwala7681]

Why in 2nd iteration there is no change in 7?? Plz explaination

[@phishyp]

​@@bhaktiarandolwala7681 On the second iteration, we are only considering 2 hops from root node, so node containing 7 is unreachable until we have 3 hops.

[@bhaktiarandolwala7681]

​@@phishyp hey thankyou

[@antoniopinto6222]

2nd iteration why is cost of 2 not 5-2-2? path: 1-4-3-2.
Edit: oh i think its because it can only have max 2 edges.

[@sadhanasaraswathi706]

Nice expaination
It helped me in my internal😄

[@zn4798]

clear explanation

[@kaghak1422]

Thank you so much! very helpful

[@yezzarayene]

Merci ❤️🙏

[@c.danielpremkumar8495]

Why can't we make all edges positive by adding 2 (or more than 2) to each of the edges and then apply Dijkstra's alg. This would (I think) make the alg work even for negative edged graphs.

[@ewdlop1]

you can google counter example for that

[@coledrain2158]

Nice thinking

[@gshan994]

y to add extra overhead?

[@googlefriend6178]

Single source and bellman comes in greedy algorithm!

[@chienphung9633]

not easy to understand, acutually

[@gepliprl8558]

Aww horible. Explain it slowly, like einsten said you must be able explain to kids or else you don't really understand it yourself

[@saadmanahmed860]

very very refulgent illustration..

[@nikhilaghav3979]

worst explained