L-4.13: Bellman Ford Algorithm | Dijkstra's Vs Bellman Ford | Single Source Shortest Path

[@shravyasaradhipatel]

Your explanation is crystal clear ... Thank you very much !!

[@fatimaaurangzeb7892]

It is so easy to understand your lectures. Sending love and support from Pakistan!

[@walikhan138]

I'm also😘😘💝

[@asurstark]

My answer is same nothing difference.... (Indian 🇮🇳 Version)

[@techflip9842]

Pakistan mai bhi b tech hoti h kya

[@akaafighter]

​@@techflip9842 😂 sayad

[@mysterygupta610]

Kewal love & support hi bhejna😂

[@satyamjha-codeindwala6666]

The Bellman-Ford algorithm is an algorithm that computes shortest paths from a single source vertex to all of the other vertices in a weighted graph. It is slower than Dijkstra's algorithm for the same problem, but more versatile, as it is capable of handling graphs in which some of the edge weights are negative numbers.
0:00 - Working

[@nitusah1985]

I have watched a lot of Videos related to Bellmanford. Just so you know, you don't have to relax all the vertices in 1st iteration and then you will start in 2nd iteration from the starting point, and again all the vertices relax till n-1 times. it really doesn't matter at the end in the results, but if you are coding it, it matters how our loop works. You explained in a good way, I not still not sure if both ways are right.

[@reliefofcontentmusic7544]

Jisne bi ye iteration word bnaya hai na. Usse jyada glt ajtk is duniya mai kise ne ni kiya 😂😂

[@allwell8570]

Sir your understanding clear.
That's why your explanation also 🙏

[@shradha5155]

Thank u so much for all ur vidoes..specifically for DBMS. I request u do some videos on mobile computing..sir . U r a life savior.

[@darshanpatel_1611]

Arey sir kya fadu padhate ho aap 💪 dil ❤️ jeet liya apne to

[@0neAboveAll]

I have prepared all subjects by watching your videos u are genius. Sir you are my Einstein, my Newton, my Galileo and my Hawking. Thank you.

[@HarshMehta-oi9hn]

haha copied from "genius" song🗿W

[@0neAboveAll]

@@HarshMehta-oi9hn 😅🤭🤫😉

[@sumedhvichare1388]

You're a legend

[@rekhapatil304]

With short examples explained such a tricky concept. Thank you

[@aniketmasram6500]

Thanks for making the algo understand easily ❤️

[@salmabano-mi4xb]

Hello varun.. u are extremely good teacher..can you pl explain about big O notations and how to calculate it for different programs.

[@GA13059]

Thank you so much sir for giving us this type of valuable content 🙏🏻

[@SatishSinghSigma]

Love the way you teach...❤

[@anushkatripathi9376]

You are best teacher

[@asraarfiza701]

Thank you sir for this video😇😇🤩..... I was waiting for this one only

[@GIT_Somya]

Thanks for making a video on this topic

[@fundunya4698]

Love you ppr h 10 bjy or mn bethi smjb rhi itna easy smjhtty hnn

[@sanskritipanjwani9072]

Understood so easily, Thank you sir!

[@emaankhan20]

In 2nd example, in 1st iteration, c should have been updated to 30 instead of infinity. Not in the next step (because in Bellman Ford there are limitations on iteration, so we cannot skip steps).

[@xyz-pc3tl]

Thanks a lot sir for your all hardwork 🤟🤟🤟🤟

[@pawanmishra1942]

thankyou kal paper he or aaj ye sikh liya

[@bushranazir7978]

Very informative knowledge Sir.

[@divasensations2658]

You are life saviour sir, hats off to your teaching ❤️ . Lots of best wishes to you, keep emerging, keep making videos, and you'll get all love and support from us. Love and support from Kolkata ❤️

[@barkhajain7003]

very well explained

[@anonymous........]

Thank you 👍

[@souritranandy6270]

excellent explanation sir❤

[@irsaliaqat1650]

Here one night before exam any one here😂😂

[@DeadPool-js8mj]

Us bro us

[@psbsff576]

How to you know

[@appusadism4410]

1 hr before exam 😅

[@chaudhrysamtech7269]

3 hours before university exam

[@s-rf7zc]

Everyone

[@sayyedshoaibahmed8373]

Thanks a lot for this video you really make it easy for me to understand bellman ford ❤

[@uditnarayan7149]

Sir g, tussi great ho 🙏🙏🙏🙏

[@mafiaop822]

THANK YOU VERY MUCH SIR 🤗🤗

[@onmywaytopassion5382]

Thanku bro, exam se do ghante pehle dekh rhi hu, very helpful

[@puc2792]

Mai bhi viva se ek din pehle Dekh rha hu 😂

[@coders8180]

Sr bhi bol skti thi i think ki mtlb everytime bhaukal n ldkiyo wala showoff hr jgh jruri to ni hai

[@rehanahmad6699]

Same exact 2 hr pehle 😂

[@muh_hassu]

he deserves more subscribers

[@storiesshubham4145]

Every time I watch it, every time I wanna give it a like

[@neerajmahapatra5239]

Even my college professor is studying from your videos. Same explanation same example😅😅

[@ikramullah1718]

You are good teacher ...

[@aliyakhan8271]

I love you sir teaching

[@whee_inmyhoney2071]

Ty so much sir ❤🙏

[@theayeshatkhan]

Well explained ❤

[@attadhillu120]

Excellent method 👏

[@anushguggi]

You are the best !! Very noble !! Lot of love ❤
Want to meet you once I clear my NET!!

[@bmdailyvlogs]

thank you sir its so helpful☺

[@mystery1168]

Sending love & support from Pakistan ❤️

[@ashishsinghthakuri6734]

You r the best❤❤

[@jasminesamantray4740]

Here one hour before exam 😂😂

[@rohitrathod8210]

MU UNIVERSITY 😂😂😂

[@VikasKumar-zu9ju]

Raat main ho raha hai kya paper 😂

[@Laskar_king]

Love from HKD

[@Be__you]

Great way to teach 💕🙏

[@sameerahmed832]

Amazing

[@yum-yum8067]

Bro.. U r the best👍💯

[@deepshishodia5878]

Thank you sir🙏

[@md.basimali9413]

Thank you sir❤❤

[@dhruvilsoni4900]

Thank you sir for the videos !!

[@goutampal5521]

Thank you ❤

[@aneeshsharma1759]

Thanks a lot Sir!!

[@mohitkaushik21]

Thanks sir 😊

[@Manish-ku-mar]

please make a video on ford fulkerson algorithm for max flow , all your videos are great help...

[@R.bhatti-2125]

Legends on exam day 😂

[@bijeshkumar8977]

Sir kitne simple hain T-shirt ka bhi batam lga kr rkhte hain 🙂🙏

[@piyushtripathi5566]

Thank you sir ❣️

[@L.S.Yadav.]

Thank you sir
Pta nhi aap nhi padhate to hamara kya hota 🙏🙏

[@hannanbaig7888]

At 8:56, how do you do 0+2? Shouldnt it be 0+5?

[@AZCreation997]

Thank you so much Sir,

[@dipesh1401]

I think first example is wrong.Dijkstras algo may or may not be able to find shortest path in -ve edge graphs.And in your example Dijkstras algo will work perfectly. here is the output ::---
(null refers to source)
Min distance:-->0
A-null
Min distance:-->10
B-A-null
Min distance:-->2
C-B-A-null

[@deepak_Yadav-hw1r]

Thank u sir ❤️

[@umangkumar2005]

in your question there is negative weight cycle so we can't using bellman ford cycle

[@harshnegi5811]

Still no dislike!!! LEGEND

[@pokigamerop]

still

[@anooshadurrani6738]

still😅

[@MrAdilTalk]

Thanks sir for this

[@shivamojha1046]

salute sir

[@avaneeshj.damaraju175]

good

[@continnum_radhe-radhe]

❤❤❤

[@sohaibahmad7210]

12:11 why are we taking value of b distance as infinity when it has been updated to 10

[@supratim009]

It's 8:43 exam on 10

[@prajwalsingh3702]

Bbd attendance... kal ke liye

[@animeshhazra3727]

Nice

[@hasantariq1252]

I am pkaitan 🇵🇰 sending love and suport

[@mugheesismail264]

Start wathing at 1:30, save time

[@NaveenKumar-pp1qs]

2:14 why can't we relax B, because A->C->B=5-8=-3?

[@raja17]

Mistake I guess

[@lazyleader7568]

Directed graph.... there is no path from c to b

[@adityakumarchahal2852]

0:43
Bilkul Sir subscribers bohot jruri hain😂😂

[@shrutibhadiar5172]

❤️❤️

[@to__the__point]

Watching after 3 years of college!😄

[@bushranazir7978]

May Allah bless uhh Sir.

[@divyagupta543]

❤❤❤

[@ashgirl1023]

Can u plz make a video on guess jorden method?

[@owaiskhan2977]

nice

[@fasiulhaq2366]

Love from Pakistan❤

[@ipshitachakraborty4157]

Sir u r excellent. But i am want to know how i can prepare for gate. Like how much time to be given on these topics

[@SohamChowdhury0808]

❤️😃

[@alishbamumtaz2310]

Why did my sir taught the exact two questions in class?😂 Ig he even revised his concepts though yr lecture 🤭

[@LearnTech2685]

Thanks sir, but what happen if bidirectional graph given?

[@pratapkumarsahu3135]

🎉

[@lazyweirdo4419]

Here on the morning of the exam 😅

[@unknown-x3l]

what is relax ?

[@manishpailwar3886]

Watching this video 2 hours before the exam.

[@nikitapandey6953]

why we get exams, here at 12 at night, and tomorrow is my exam😢

[@indfaith6004]

I am at 2 30 am broo

[@anshulanand02]

00:35 A.M. 😢

[@SachinKumar-zo4hc]

sir please do embedded c programing Playlist

[@Dhananjay_katre]

Today my exam at 1:00 pm
I'm here at 12:18 pm 😅

[@divyas3890]

What if their is no direction with negative weight it is solvable or not

[@harshulk05]

done

[@simplecreation5108]

Sir..when we let the distance of B to C ....how we know that it's gonna be nagetive value....actually my doubt is distance should be positive .so I can't understand sir..

[@osamaakbar8780]

How to relax in 3rd step from 0+2.... because edge value is 5. You are said .......

[@hannanbaig7888]

Same confusion

[@lord_yzal]