Lecture 95: Dijkstra's Algorithm || C++ Placement Series

[@__k.abhishek]

Aapke samne 20, 000 wale courses bhi fail hai 🚀🚀. Lovely to have such mentor..

[@vishalgarna4580]

Babbar bhaiya ko great thanks to explain in detail ❤❤

[@shalinisaini3787]

Thank you for this amazing course

[@kashishjain8133]

Thanku bhaiya for such a great series. Consistency++ Josh++

[@PKMKB93000]

Bro how many days it took you to complete all video lectures till this video?

[@soumikmondalofficial]

@@PKMKB93000 5 days

[@PKMKB93000]

@@soumikmondalofficial impossible

[@soumikmondalofficial]

@@PKMKB93000 I am just talking about graph series. This is no.10 video 🙂

[@PKMKB93000]

@@soumikmondalofficial oh 🤣

[@Ybash2979]

More power to you bro itna time dedicate krne ke baad bhi itni bdia explanation chuma ekdum

[@anupamtiwary4265]

It felt bad when he said "iss video ke sponsors nahi hai" with a smile.

[@sarthaktyagi1077]

Perfect Topic considering today's leetcode question of the day.

[@alexrcrew1975]

yeah u r riight

[@dhanjeekumar1906]

Thank you so much bhaiya for such great DSA cotent Energy++ , cosistency++

[@pramantomar822]

Bhaiya negative comments ko plz ignore karna u r the best and we are always with you Most importantly take care of your health ❣️❣️❣️❣️❣️

[@amitsarje9428]

Hi Love bhaiya. Your channel has helped me a lot to prepare for DS algo questions , thanks a lot ! Thanks to Lakshay bhaiya for the awesome OS series !

[@Ayush_.]

bhai DSA kaha se kiya thaa & Question practice kaha se kii thi ??? CP bhi ki thi kya

[@sachinupreti7159]

@@Ayush_. without CP ? AMAZON ? you have got to be kidding with us ? even TCS digital requires CP. then it's AMAZON

[@Ayush_.]

@@sachinupreti7159 There is No need of DP if you are good in DSA

[@TuringTested01]

​@@sachinupreti7159 konsa alcohol drink karrhe ho ajkal? send link

[@usernamewhatsoever4557]

bro apne leetcode gfg and codestudio profile ke links dena please

[@arpitsharma7246]

lage rho bhiya consistancy maintain rakhna apke jaisa teacher koi nhi

[@PankajKumar-uk8uj]

low energy ?? Redbull should make you their brand ambassador Babbar bhaiya you have the best explanation!! thank you!

[@usernamewhatsoever4557]

Din ke 4 videos kar rha hoon, july end tak dp bhi ho jayega then bas sliding window prefix sum graph coloring aur 1 2 topics bachenge thank you bhaiya placement lagi to party zarur dunga

[@Aman-fz1ew]

4 videos good

[@Anonymous____________A721]

Did you get 😢

[@HarshitSharma-h9o]

@@Anonymous____________A721

[@AkashSingh-ds3pd]

Babbar bhaiya In this video-->>"Daro mat is video me sponsors nahin hain"🤣🤣🤣🤣

[@gw-lol948]

Bhaiya Apka y tutorial Bhut helpfull h😍 thanks ❤

[@laxmankumawat6728]

Peche Wale me distance array samj nhi aaya tha but now is clear 👌👌💘

[@TechUprise-by-Jyoti]

Consistency OP. Thank you bhaiya🙃😇

[@017_indrasen9]

4:30 daro mat iss video mein koi sponsor nahi hai 🤖

[@RohitSingh-hc8yi]

Hats off to your efforts bhaiya

[@RohitSingh-hc8yi]

loving your lectures bhaiya

[@Niki_0011]

Best dsa series ❤❤

[@sujeetkumar6971]

100% placement oriented learning Bhaiya keep it up....

[@shekharsuman3219]

Bhaiya keep inspiring us we r with u

[@NihalSingh-ld2en]

Thanks, aj subah se ye topic ka video dhund rha tha jis se kuch smz m ae

[@skchoudhary7956]

Graph series...full on fire🔥🔥...Babbar bhai chahe 2-4 videos jyada lag jaye koi dikkt nhi...lekin graph ko pura depth me krenge....💪... aur bhai limit cross krne ki jarurt nhi h...aapko bhi mazaa aana chahiye😅

[@parthtrivedi318]

Aur kitne din chal sakta hai course

[@Harry-ju9nv]

haa bhai aisa hai Dynamic programming bhi chale

[@VikashKumar-cg8tj]

Amazing Explanation

[@manikantadevadiga7146]

can anyone explain how the set works to get top by minimum distance when it has pairs?

[@vasusharma3527]

it takes the first value to compare ie the distance and set is sorted so it shows min distance always at the top

[@manikantadevadiga7146]

@@vasusharma3527 tq bro❤

[@tejveernaruka3287]

Thanku Babbar Bhaiya for your efforts

[@BEESaiShivam]

why cant we do it using method used in last video?

[@rachit_joshi]

Thank You So Much BHRATA SHREE !!!!!!!

[@KhushiKavya-py1yj]

placement season has started and bs 45 vdos left and i am not able to be consistent , next 2 months placement will take place

[@malikaamalhotra8397]

consistency++, thankyou bhaiya

[@tiwaritejaswo]

Why do we have to process the nodes in a sorted order by distance (using minHeap/set)? I tried doing it using BFS (normal queue) and it's passing all the test cases. please clear the doubt.

[@rahulrawal6542]

cuz we are updating distance every time so I guess there is no effect of taking nodes in sorted order by distance

[@salmankhader1258]

@@rahulrawal6542 No thats wrong i tried doing this using normal queue and i was getting wrong answer

[@AmanSinghRawat-ug6fr]

Brother because priority queue or set reduce the time complexity by vlogv . If you use queue time complexity will be nxn

[@rajsharma-bd3sl]

Why time complexity O(E logV ) and not ((V+E)logV) ?

[@jaipreetkaur9658]

Love bhaiya both sett video !! Bs ye record wala smjh nhi aya

[@dishantkumar6723]

are more videos coming in this free course?

[@alexrcrew1975]

definityely

[@samsmith3961]

a wise man once said,"daro mat iss video mein koi sponsor nhi hai!!"

[@barnikroy5244]

Only sher of youtube in computer domain

[@aaravsingh4571]

Bhaiya github me bache hue video ke code daal do, and agar possible ho to bache hue video ke handwritten notes bhi daal do please

[@iteself_me]

190 ✅completed 👍Liked 04:39

[@pkk5124]

Why is it that when i am using map to store dist-index i am getting wrong answer for only one value in a testcase,like for 17 nodes I am getting correct only in 16 nodes and rest all testcases are correct but only this value is wrong.Can some one point out the differnce when using map vs set. They both store elements in sorted order so where am I wrong??

[@dhananjaysharma9020]

set is ordered but if you use map it will be unordered

[@dEviL_bIsWaJiT]

Present bhaiya 🔥

[@AliShair-f7q]

can someone expliain why we are using set? why we need to select node with less distance in the set

[@simranbandhu9926]

why do we have to pick minimum value only ? what is the use of set here

[@NiyatiOffice]

set is always ordered in case of cpp, so the top will always contain min distance

[@chandrabhanbahetwar9638]

Can anyone tell me why we are picking smaller distance value first ?

[@alexrcrew1975]

anyone explain the how min pair is always picked up from set up as he told that we have to pick piar based on min distance everytime but we haven't write any logic for that here

[@ADITYAKUMAR-tb4gm]

property of set , it stores data in sorted order by default

[@alexrcrew1975]

@@ADITYAKUMAR-tb4gm ok got it

[@SumitSharma-ui7wx]

Why do we have to pick node with minimum distance, when values in distance array are overwritten whenever smaller distance is found? Can anybody explain?

[@rajeshchaurasiya9]

so that we don't get stuck in updating one node multiple node. Plus by choosing min distance first, we get the chance to reach our destination node early. plus by choosing min weight first, we have to update distances less times.

[@mkat21]

daro mat iss video mai koi sponsers ni h ..got me laughing hard. as i was expecting them as an habit.

[@kritikarawat2180]

The explaination today was not that best saw striver's 3 videos to understand this whole algorithm but was worth it.But kudos to your efforts always.This was just a feedback i am following whole series.

[@BEESaiShivam]

uhm...beside love babbar bhaiya,what are the alternatives to watch for?

[@bachaankasongs8562]

Sir main new subscriber hun mujhe pata chala hai ki aap ke chennal par laptops ka giveaway hota hai and mujhe bhi ek laptop chahiya toh next giveaway kab hai

[@bat_man1138]

Sir i think this is bit different algo from dijkstra algo..all the test cases are passing.but this is not dijkstra.. IN dijkstra we mark the vertex as PROCESSED once it is processed . No such discussions here..this algo works but it is not dijkstra Can anyone clarify please🙏 It will be great help

[@Mohit-im4kx]

we always process min distance node which is done by set and once processed we move forward also handled by set (deleting min) and once all are processed is equivalent to set being empty

[@anuragpandey8165]

consistency--

[@satyamdwivedi8135]

Bhaiya Next video? Agar fever hai toh take rest we will wait….get well soon.

[@raoshnakquadri8731]

Bhaiya code from graphs are not there in github repo. Please do push the codes in github repo.

[@WIN_1306]

please someone tell the video number at which sir taught SET

[@dudamneerajdattu1459]

isn't T.C O((V + E)logV)?

[@mubashirkhan6178]

Brother kindly object oriented programming or design pattern ke videos playlist banao.

[@Ybash2979]

bhai please ye waale code dedo or upload krdo , i have your paid course also but pta nhi idhar zaada smj aa rh

[@harshpandey4190]

I was About to skip when you said " daro mat iss video me koi sponsor nahi hai "

[@RohitSingh-hc8yi]

quite a good series

[@jhordd52]

Consistency ++ bhaiya well done

[@vortexdeo4545]

Prevent Burnout ☠💯

[@vcbstandby4388]

wonderful explaination sir

[@amishapandey6875]

Thankyou Bhaiya!!!

[@adityaraj-zm7zk]

auto top = *(st.begin( )); means

[@gunjansaxena9760]

iterator ko dereference kr rhe

[@alokranjan3185]

great explanation bhiaya

[@yashsharma3083]

Sir in Notes link only notes till lecture 40 are provided where can we find rest??

[@rajeshchaurasiya9]

one thing that was not mentioned or i might have missed: dijkstra's algo doesn't work when there are edges with negative weights.

[@Singh_Sahdev]

That's why bellman ford's algo come in existence

[@funfactff3167]

But I guess if we will use this code then it will work fine for even negative edges. As we are updating the distance array and again inserting it into the set. By doing so we are again checking for the minimum distance for every nodes. May be I have misunderstood, please correct me if I am wrong.

[@funfactff3167]

​@@Singh_SahdevBut I guess if we will use this code then it will work fine for even negative edges. As we are updating the distance array and again inserting it into the set. By doing so we are again checking for the minimum distance for every nodes. May be I have misunderstood, please correct me if I am wrong.

[@YizenOdyuo]

​@@funfactff3167 in Dijkstra algorithm once we visit a node and update distance we don't revisit that node. This is where the algorithm doesn't work for negative edges

[@UdayKumar-gu2sg]

Bhaiyya please written notes update kardo bhaiya

[@alexrcrew1975]

Why negative weights fails for dijkstra algo? Anyone please explain with help of this code

[@muhammadsuleman8936]

have you found answer?

[@honestad3558]

​​@@muhammadsuleman8936 Ab Tak to dono ko jawab milgya hoga lekin nhi Mila to mei bata deta ho negative distance har instant pe distance aur negative kartey jagey mtlb aur chota kartey jageye mtlb infnite loop mei fass jayenge

[@honestad3558]

Ab Tak to dono ko jawab milgya hoga lekin nhi Mila to mei bata deta ho negative distance har instant pe distance aur negative kartey jagey mtlb aur chota kartey jageye mtlb

[@muhammadsuleman8936]

@@honestad3558 BRO thanks for your reply.. But abhi to ma ya b bhool gaya ho ka question pocha q tha LOL... Have a nice coding journey.🙂

[@PritamDas-jj1uo]

After finding the minmum distance to a node from the source , it's not marked either the node is visited or not in the mentioned algo.I

[@TuringTested01]

it doesnt need to be, because all the edges are positive weights so there is no way to travel back because distance travelled so far will be postive as well as distance to travel will also be postive

[@niharbastia5740]

Keep going Bhaiya !!

[@shubhamkumarsingh8818]

bhaiya aur videos kab daal rahe ho???

[@vmstudy9965]

Swaad ++...🎉

[@itskaaryan7]

while creating the adjacency list why did we run the for loop till vertices and not the edges, bcoz in previous all vidoes i have seen we were doing till edges size. can anybody please clearify my doubt. Thanks

[@rajeshchaurasiya9]

that is a mistake. finish video.

[@anushkachaudhary3501]

❤ best

[@Tan-mb2nd]

great video

[@thebigexperiment1666]

Very helpfull

[@amantarar9077]

Consistency op ❤️❤️

[@GANESHSINGH-uc1gk]

amazing bhaiya!!!

[@RohitSingh-hc8yi]

thanks a lot

[@sarthak-salunke]

Keep ti up sir ❤️❤️

[@KACodes]

Bhai back in form....🤩🤩

[@DeepanshChawla_]

Bhaiyaa Thankyouuu 🔥

[@GyanworkHindi]

Sir pleas please yeh course complete karna ..

[@jaydwarkadhish959]

Very nice sir

[@manavrollno.2314]

Bhaiya thankyou ❤️🔥

[@tanishk1059]

Thank you bhaiya 🙏🙏... sab samaj aa gya

[@PKMKB93000]

Bro how many days it took you to complete all video lectures till this video?

[@tanishk1059]

Around 40 days

[@PKMKB93000]

@@tanishk1059 okay thanks for replying

[@nishankdeep3084]

thank you bhaiya

[@gw-lol948]

Bhaiya Apptitude strong kerne k koi jhugad Btayiye🥲

[@kshitijraj1320]

Thank you bhaiya ❤

[@BhaiRayyanKiDuniya]

Bhaiya yaar sponsors shoutout bhejte raho

[@fazerugbrug439]

brilliant

[@bossmemes3308]

Is it mandatory to remove the previous inserted value, I haven't do that but my program is running well.

[@gunjansaxena9760]

it increases the time complexity a little bit thats all

[@lonerider6695]

​@@gunjansaxena9760can anyone explain why we are selecting min.distance node from the set because if we take another node then also latter the distance would be updated to min only please tell

[@anuragpandey8165]

daalo yrr videos baki ki

[@yashasvic2429]

Thanks Bhai 👍

[@eshaanbagga5159]

I don't think removing the already present is necessary. Correct me if I am wrong.

[@meme_eternity]

can't be there a path from 0 to 0 less than 0 as there may be negative weights also in the graph and they sum up to negative making that path the shortest path?

[@neerajkhatri9398]

This is the reason why Dijkstra's Algorithm fails when we have negative weights.

[@muhammadsuleman8936]

can you explain this plz ? how it fails on negative weights?@@neerajkhatri9398

[@godwalker8617]

bhaiya the course is good but bohot lengthy h itna flow bnn hi nhi paa rha h 1 mahine se krr rha hu sirf 35 vedios hui h plzz isko thoda compress krdo bss basics clear krne k liye taki questions krr ske but love the content !!!!!!!

[@PKMKB93000]

Bhai how many videos do you cover in 1 day and how much time did you dedicated to it?

[@PKMKB93000]

@@V418H4V Ha jabhi me CWH chodh ke is playlist pe aya.

[@koitohu5661]

@@V418H4V bro ye enough h kya course I am in service company aur mujhe DSA krni h. Love babber ki playlist enough h kya kya DSA aa jaayengi isse

[@thebigexperiment1666]

Great sir