Dijkstra Algorithm | Intuition + Code + Dry Run + 2 Methods

[@CoderArmy9]

Full InDepth video hai, I promise u will never forget the algorithm ❤️

[@ravikant123_4]

❤❤

[@newglobal2056]

❤❤❤❤❤ it was really great 👍❤

[@machinecode2.047]

Yes sir 🎉

[@iamnoob7593]

in a complete graph push operation takes V-1 * LogE right for all nbrs for each iteration in while loop right?

[@koushik4178]

very nice explanation and very helpful.

[@sudemnarzary]

1:34:00 HomeWork :-
HomeWork :-
// for sparsh graph .
vector dijkstra(int V, vector adj[], int S)
{
// vector conformed(V,false);
vector dist(V,INT_MAX);
set set; // nodes which distance are not conformed ,
dist[S]=0;
set.insert(make_pair(0,S));
while(!set.empty())
{
int node = set.begin()->second;
int nodeWeight = set.begin()->first;
set.erase(make_pair(nodeWeight,node));
for(int j=0;j

[@tanushreem01]

what will be its time complexity? ElogE or ElogV

[@developerSuyash]

Hello Bhaiyya , even though I was very late , I discovered your channel 2 months ago , I have watched each and every video of yours , like a web series , and kasam se bata raha hun , you explain much better than the others bade bade youtube , aap samaj gaye honge kiski baat kar raha hu , you have good explanation skills , Thanks .. and also I have watched 7-8 videos of yours per day with revision , now finally I am along with you in synchronisation . I am in final year now and meri placement nasdik hai jiske liye mujhe darr bhi nahi lagg raha hai

[@ShibaniDas-uv3tt]

Beautiful in-depth explanation !!
Amazing amount of efforts you have put for this masterpiece. Thanks a lot.

[@allinonemoviesyt]

1:34:05 Homework : Dijkstra using Set
vector dijkstra(int V, vector adj[], int S)
{
// Code here
vector dist(V,INT_MAX);
dist[S] = 0;
vector visited(V,false);
set st;
st.insert({0,S});
while(!st.empty()){
int weight = (*st.begin()).first;
int vertex = (*st.begin()).second;
st.erase({weight,vertex});
visited[vertex] = true;
for(int i=0; i weight+adj[vertex][i][1]){
dist[adj[vertex][i][0]] = weight+adj[vertex][i][1];
st.insert({weight+adj[vertex][i][1],adj[vertex][i][0]});
}
}
}
return dist;
}

[@laxmikant9954]

Hello bhai notes banaye hai ky?

[@sachinprajapati815]

for me it's theory used to seem hard when I studied it in my class but now I am confident in code also.

[@ujjwal_7531]

some months ago i was scrolling reels and saw a visualization for dijkastra algorithm between two location in a city, and thought if i couls understand this, i didnt knwe u will be the one to explain this in this easy manner

[@ShibaniDas-uv3tt]

The time & space complexity explanation was too good !!
Great job Rohit !!!

[@Sanataniblood-mb5pu]

No one near you at your explanation bhaiya jabardast explanation baap level ❤🙏🏻

[@dealseasy363]

Crestal and clear explanation....

[@MohitKumar-b5o3b]

love you bhya app taecher se bhi upar hoo ek din app billionare banoge and you can save my this word it take some time but one day it will come when all indian standup for your respect

[@vijaysingh-n6p9j]

Salute h bhaiya aapko❤

[@mohit6215]

2cr for a REASON ❤❤

[@iamnoob7593]

Thanks for the great explanation

[@ankushladani496]

Maja aa gaya Bhaiya...🚀💥

[@yatindanger]

Maja aa gya bhaiya. ❤❤❤❤ Best Lecture ❤❤❤❤❤

[@AbhishekKumar-vd1po]

simple explanation, great video

[@shubhamkumarjha9192]

Bhaiya aap litterly bhot hee pyaare ho, good morning bhaiya..

[@gopalmalpani1947]

no words 👏🏻👏🏻👏🏻👏🏻👏🏻👏🏻👏🏻👏🏻👏🏻

[@rejaulislam2593]

every part is best vaiya

[@thegamechanger6261]

superb explaination bhaiya

[@ankushladani496]

Bahut simple laga Bhaiya...😊🎉

[@iamnoob7593]

in a complete graph push operation takes V-1 * LogE right for all nbrs for each iteration in while loop right?

[@deepanshuagarwal2471]

great bhaiya what a explanation

[@iamnoob7593]

in a complete graph push operation takes V-1 * LogE right for all nbrs for each iteration in while loop right?

[@nidhiraj9686]

Best explanation ❤❤

[@ujjwal02]

Day 12/60 ✅

[@freefact7538]

Thank you bhaiya ❤

[@RanjanSingh-wl8zt]

Good morning bhaiya❤

[@CoderArmy9]

Good morning bhai❤️

[@hiteshsharma5034]

Good Morning Bhaiya...

[@CoderArmy9]

Good morning bhai❤️

[@CalmingVideos-qm3rn]

Dijkstra's concurred finally ❤

[@heetpatel3037]

Jai shree Ram ❤️
Aap shabd nahi hai mere pass dhanyawad sirji
#2crforareason

[@mohanjha4397]

❤️❤️❤️❤️🤟🤘✌️🤞👌 well deserved 🎉

[@ankushladani496]

Thanks Bhaiya...❤😊

[@itshirdeshk]

Day 208 ✅🔥
Day 12 ✅🔥

[@tusharsingh7927]

Rohit bhiya, ek baar "chai aur code" ka video dekh lijia...C++ ke upper hai please.

[@allinonemoviesyt]

good morning bhaiya ji

[@AnordinaryMan007]

chamak gya acche se

[@kishan4735]

Amazing

[@YashSaini007]

Bhaiya Radhe Radhe 🙏

[@Harshmishra0007]

Ram Ram Bahi❤

[@CoderArmy9]

Ram Ram bhai❤️

[@AMITKUMAR-ds4hp]

Good morning boss ❤

[@mohituniyal7]

bhaiya main to aapka channel sabko batata hun. Premium course mein same yahi padhate hain. Maine coding blocks ka liya tha.

[@sarangkale6761]

Jai shree ram bhaiya 🙏🏻❤️❤️

[@User-yb3yc]

Best video sir

[@yadiencollection5073]

Ram ram bhaiya good morning 🌄

[@amitkumarmohapatra8531]

Day 12/60 💖

[@anuragojharaj]

Great

[@zishanchaudhary2636]

good ❤❤❤❤

[@deepanshunegi982]

Bhayya please make video on leetcode problem for dsa.

[@abhishek6575]

TC should be ElogV in case of using priority queue

[@iamnoob7593]

in a complete graph push operation takes V-1 * LogE right for all nbrs for each iteration in while loop right?

[@SubhashKumar76-x8g]

mja aa gya❤

[@MrSagar-8]

ROHIT BHAIYA Agar apke hazaaron views hai to unmein se mai ek hoon ,
Agar aapke ek view hai to wo main hoon,
Agar apke koi view nahi hai to samjhe Mai mar chuka hoon "❤❤❤

[@GulshanSharma-r1r]

bhai tune to fan wala dialogue use kiya h waah😂😂😂

[@SaiKrishna-ze4vd]

Is operating systems bya galvin enough for gate
Some one please reply

[@anupammishra6514]

Good morning 🌄

[@marveladda9761]

hiiiiiii

[@ManishSingh-m1m]

@@marveladda9761 bhai tujhe good morning nhi boli h 🤣🤣 khi to chhod de bhai ab youtube cooment section me bhi

[@YashSaini007]

Day - 12/60 #60DaysOfCode

[@sagarprajapati6026]

Day 12/60

[@letsk9188]

Bro kl lecture ku nhi aaya tha

[@GulshanSharma-r1r]

Day12/60 #60daysofcode

[@rocketgamerzz.7577]

Reached till here

[@be_a_DT]

Sir, What if The weights of the edges are negative numbers 💀 ??

[@CoderArmy9]

Don't worry, sab kuch explain kiya hai aage...

[@be_a_DT]

@@CoderArmy9 Thanks Sir !!

[@sagarprajapati6026]

Live aa jao kisi din rt ko bhaiyaa kuch batcheet ho jaye

[@Kanishk-nx4xg]

done

[@devloper_sachin]

Waah!

[@letsk9188]

Gd morning bro

[@Kattar_hindu234]

Vote for web development ❤

[@gajendrasinghdhaked]

😍

[@maheshpatil1750]

watching in sep 2024.......

[@vinayakseth353]

Chamak gya

[@Rakesh-b4j]

❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤

[@ayushpanwar1671]

djkstra++

[@hiteshsharma5034]

💌💌💌🤟🤟🤟🤟

[@CoderArmy9]

❤️

[@pradeepraghu1see]

gg

[@VineetDixit]

chamka !!!!!!!!!!!

[@nainplayz4795]

bahiya ap whatsapp community ma koi post ni laga rha >>??

[@sayanacharyya250]

Thank you bhaiya ❤