L-4.10: Dijkstra's Algorithm - Single Source Shortest Path - Greedy Method

nice explanation

thnk u!!!! indian friend!!!!!

Gate Smasher Rock

Crystal clear explaination, I think you are one the few people who can explain daa very well. Thank you sir!

Love for you sir Bangladesh

U worth the knowledge

❤❤❤❤

Sir eska answer kai log aysi table k form m likhte hai aur kai log paragraph bna k likhte hai
kaunsa shi hai?

confusing hai bhai

Aapki awaaz bahot zyada pyari haii😍nice explanation i understand all the concep🥳🥳👏👏

Best teacher ever hpy bdy varun sir sorry for late wish may god bless uhh

Respect

happpy birthday sir

Thank you sir
Lots of love and respect from Pakistan 💓

Just Try Intro Music in 1.5x speed

Ggs

Sir you are best you are covered all the topic of my subject and i am pass easily by you

Love from Pakistan ❤️✨ ma APNA fav drama itnay Shok Sy ni dakhtii jitnay AP k lecture dakhtii🙂👉🏻

Thank you sir ❤

Good explanations

Mind > matter

Sir please teach in English also.

Thanks

Mind>metters 🙏🙏🙏🙏🙏👍👍

👌👌

getting the point or not

Which will do first when both vertices have same distance

ALLAH g will blessed you bro,from pakistan.
🥰🥰🥰🥰🥰🥰🥰🥰🥰🥰🥰

1 hour: exam🥺

wo via bad m ay ga😂😂😂

Really you are superb 👏🏻👏🏻 great sir

guys the correct pronunciation of Dijkstra has j silent (DYE-KS-TRUH)

you just taught process which in not applicable for every question

Nice

You can reach 5 from 1-3-6-5 with weight 19

Y current rtu k syllabus n kya

nice explanation

subscribers bohot zaruri hain

You are Grreat teacher sir jiii 💞jazakallah 🥰from pakistan.

nice

Best ever video....ek vdo dekhte hi subscribe kardi😊😊😁😁

Thank uhhhhhhhh 🥺❤️

You explained it in a very easy way . Thank you sir

Thank you sir 😊

Undirected ka kyu nhi solve kiya isliye ki vo hard h ya fir isliye ki directed hi aata h

Sir means te shortest path ch Minimum weight 20 yeil n m