Dijkstra Algorithm in Graphs | Single Source Shortest Path in Weights | Graphs Algorithms in JAVA

preview_player
Показать описание

NADOS also enables doubt support, career opportunities and contests besides free of charge content for learning. This video discuss the Dijkstra Algorithm in Graphs to find the Single Source Shortest Path in Weights using a Priority Queue (Heaps). This algorithm in similar to Breadth First Search (BFS) where we used a queue instead of a priority queue. We then state the problem where:

1. You are given a graph and a source vertex. The vertices represent cities and the edges represent distance in kilometers.
2. You are required to find the shortest path to each city (in terms of kms) from the source city along with the total distance on path from source to destinations.

#graphs #dijkstra #greedy

Рекомендации по теме
Комментарии
Автор

You made dijkstra's algo so simple. Even Dijsktra would have liked for this impementation!

reyazahmed
Автор

sir, aaj aapke 2 videos dekhe, get saged, aur singh in USA zabardast, salute to your honesty, respect 100%.
your video making speed is too much faster that my watching speed, your hardwork will definetely pay off, god will definately help you to fulfiill your mission.
In near future, every coding guy will know your motivating us by your hard work summet sir.

kuldeepnarayanminj
Автор

I was afraid of Dijkstra before this video. Thanks a lot for making it so easy!!!

TunTunKidsRhymes
Автор

THANK YOU FOR AMAZING CONTENT FOR FREE to support students who cannot afford it and wish to learn. Never seen a person like you

ankitamehra
Автор

this is the first time in my life that i have found dijktra's easy : all the credit goes to you!

monikavaid
Автор

I still can't believe how simply you explained dijkstra. Hats off to you sir.

anishranjan
Автор

This is one of best YouTube channel I have ever encountered, Thank you so much for your kindness.

biswadeepchakraborty
Автор

i watched sir's videos became a specialist on codeforces, yesterday i had a doubt in a question that need this algo, learning again from sir

cheforces
Автор

Can't belive you taught it so easily.
It was like just a cakewalk
Let me make it clear once again
Sumit Malik sir is underrated.
Gonna share this video with all my peer group.
Love you sir and thank you sir.

AtithiKumarSingh
Автор

I am doing DSA in C++, but your videos are so powerful to understand the concept. Thankyou so much Sir

priyankajhamb
Автор

Sumeet Sir... The way you teach DSA is exemplary...!💫
I can't thank you enough for the subtle yet powerful way, you tackle the fear of students... of exploring unknown territories and make them super ready to conquer them with ease.😎

And the thing you said about being familiar with the things make them "Sher" from "Bhoot" is now my life's tagline!!💯🤭

Thank you Sir... Aaj likhe bina raha nhi gaya... May God shower all blessings upon you forever!🙏🏻😇

somyasaxena
Автор

Graph used to be difficult topic for me before watching this video you make it so simple and easy Sir, ThankYou for you efforts❤️

sakshamsolanki
Автор

Teaching sir ki mind blowing hai. Seriously 😘❤️🔥🔥🔥

karanveersingh
Автор

Sir aapka BFS tree wala method is awesome. Now I am able to visualize BFS very accurately. Your teaching methodologies are truly unique.

nikhilgoyal
Автор

Thanks, i checked many other video, but this one was best, and simplest.
Loved it !!!

hemantvardani
Автор

Thank you sir for wonderful explanation, I saw so many videos for dijkstra algorithm but didn't able to understand but your explanation is on another level

UCHAmanGupta
Автор

Sir .. kya hi bole ab 🥹🙏.. speechless hain aur dukhii hai kyuki ye playlist bht late se pata chali🥺🥺 .. sir dil se dhanywaaadd apka 🙏

akankshasinha
Автор

This algo made so easy with your approach, awesome job

rajeshkishore
Автор

Best explanation of Dijkstra Algorithm so far. Thank you!

TheAngelyup
Автор

Sir, watched your two interviews other youtubers, Harnoor and Umang....
Nice videos and great channel with free learning resources.
Liked, subscribed, and shared.

gdthegreat
visit shbcf.ru