I have spent many many hours trying to understand djikstra, and you just explained it clearly in 12mins. I finally get it now.

@techdose4u

4 жыл бұрын

Nice :)

Amazing channel.I found this channel in lockdown and now i become fan of this channel....

@techdose4u

4 жыл бұрын

Thanks bro.

@MadForCs16

3 жыл бұрын

me too

@yihongliu3850

3 жыл бұрын

same here

Thank you man for all the effort you put into this!

One of the best explanation + implementation on Dijkstra. Thanks!

waah sir kya baat h , itne kam time me itne clearly dry run karke samjha diya aapne... RESPECT

@techdose4u

3 жыл бұрын

Thanks

Really. Your channel is one of the hidden gems of KZread :).

@techdose4u

4 жыл бұрын

Thanks bro.

Watched many different videos but understood well in this video. His way of teaching is great

@techdose4u

3 жыл бұрын

Thanks :)

i am very thankful sir after after watching your video i decided to read the data structure .. thanks sir for making videos. i can't express my happiness thank you sir : )

@techdose4u

3 жыл бұрын

Welcome :)

Please provide links to actual code if possible (preferably in c++). You are an excellent teacher btw. I hope this channel grows to become more famous.

@techdose4u

3 жыл бұрын

Thanks. I provided code link.

i am going to mark these number of views because there is going to be a time when this channel will become huge and i will be able to remember that i was there when it had mere 2k views.

@techdose4u

3 жыл бұрын

Thanks bro ❤️

You guys keep increasing the beauty of KZread day by day❤️

@techdose4u

3 жыл бұрын

❤️

Awesome,new channel and best graphical repersentation making understanding easier.

@techdose4u

3 жыл бұрын

Thanks :)

Graph playlists are really helpful Thank you 🙏🙏

@techdose4u

3 жыл бұрын

Welcome :)

Good one

Really great video, enjoyed it a lot. @techdose - What software are you using for writing in the black board ?? Just curious :)

This man has amazing teaching skills...

@techdose4u

3 жыл бұрын

😅 Thanks

Your decision to make graph playlist is successful 🙏🏻

@techdose4u

3 жыл бұрын

Nice to hear this :)

Really such a beautiful and helpful explanation 😊 Thanking you so much sir 😊☺️

@techdose4u

4 жыл бұрын

Welcome bro :)

Awesome work buddy

I wanted that if someone could help me in giving the crux behind its working, the video is great and might be helpful for audience, but these are the steps which is being followed more of a "do this to get ans". I am not even getting the info for a lot of things going into this algorithm just because not able to get the "why" of an algorithm, but thanks for the great efforts, you have put in for creating the video👍🏻

What an explanation sir really awesome.Your videos are helping a lot for my preparation.Thankyou sir.

@techdose4u

3 жыл бұрын

Welcome :)

Great video. By the end of this year I might complete watching most of the video. Only few left 😅☺️

@techdose4u

2 жыл бұрын

Great ❤️

Damn ..his explaination

I understood it so well!

@techdose4u

3 жыл бұрын

Nice :)

Big fan of your explanation. Thanks for amazing work. On same topic of Graphs, wonder if you can cover Tarjan algorithm when you get chance... Famous related question: 1192 Critical connections in n/w.

@techdose4u

4 жыл бұрын

Thanks. Sure I will cover tarjan's algo. But currently I am just focussing on completing Algorithms. After this I will start with other topics and meanwhile I will keep adding problems on related graph topics to make it fully complete. This way I won't get stuck at just one topic for long. Graph videos takes a lot of pressure 😅

Thanks bro;! Amazing...!!!!

@techdose4u

3 жыл бұрын

Welcome :)

differnce between dijkstra and minimum spannin tree is that, In dijkstra you have to minimize distance from starting node to each other node in a graph, while in minimum spanning tree you have to minimize the total cost to cover all the nodes in the graph it does not matter if cost from starting node to any node is munimum or not total cost to visit all the node must be minimum.

sir I really love the way you explain.can you make videos on floyd warshall and bellmanford algorithm

@techdose4u

3 жыл бұрын

It will come soon.

Hi, At 10:08 , How/when did you compute that node 2 will be connected to node 0 and not with node 1, 3 or 4. Means, I am not getting how are you deciding the parent child relation for the Final Graph

@krishnapraveen777

2 жыл бұрын

When the node 2 is included in the processed set , then we see how we are reaching node 2 in particular at that snapshot. At the time it is being included in processed set the minimum distance is from node 0 which is 4. There should be another array which stores the link of each node to its connector in terms of minimum weight, but that is not shown here.

Small correction @ 11:55. The shortest path is NOT DEFINED in case of negative weight cycles. So not only Dijkstra but no algo would work on a graph having a neg cycle. However, Dijkstra may or may not produce the correct answer in case there are Neg Edges unlike Bellman Ford.

Other than increasing cost, I think prims algo and Dijkstra looks very similar.

Nicely explained 👍

@techdose4u

3 жыл бұрын

Thanks

Hi sir, Please make a video on how to prepare for interview for people with experience in service based company for 2 years. And what roles they can apply for product based companies. Is it required to prepare system designs as well?

@techdose4u

4 жыл бұрын

You can ask me this over chat. I will let you know. Use LinkedIn or Instagram.

This is an amazing explanation. Quick question - can this algorithm still work from any source to destination specified by user input for example?

hello sir , may u plz tell me from where I can get code for this

Video is very nice . I didn't find the Code link for this algorithm

@techdose4u

3 жыл бұрын

Check description

Thankew sir ❤❤..sir please upload warshall, Tarjan and kosaraju algos, when you will get time ☺

@techdose4u

4 жыл бұрын

Yea sure. I will upload them don't worry.

@kirtigera2225

4 жыл бұрын

@@techdose4u thankew sir

@techdose4u

4 жыл бұрын

Welcome :)

I have a question here, what if the weight from 0 - 1 & 0 - 2 are 1, since both are same, which one has to be picked? if 0 - 2 , the total path will have more weights compared to 0-1 path 🤔

@rajeshsingh-mv7zn

Жыл бұрын

nah If 0-2 is picked then after that 0-1 will be picked as no other candidate will be suitable for the job (candidate will include 2 adjacent nodes)

sir plzz yeh dijkstras algorithm ke notes aur coding send karde takhe mein apne paas download kar sakhun plzz?

Explanation :- Awesome since forever.

@techdose4u

3 жыл бұрын

Thanks 😊

Can we use simple BFS instead of Dijkstra's algorithm ?

@bullshitdepartment

Жыл бұрын

that would work for finding the shortest path based on the number of edges, but if each edge is weighted it wont work

Please give code using priority queue because adding new nodes to priority queue will increase the time complexity

This subject is wild man. Like seriously wtf is even going on 😂

Wow . Middle of the night

@techdose4u

4 жыл бұрын

Haha 😂 Just completed editing.

Why set data structure is used here?

@techdose4u

3 жыл бұрын

You can use array as well. Just to mark the nodes which are processed

@mrudulaahire1360

3 жыл бұрын

@@techdose4u Thank you!!

Not sure why is it called shortest path. We are actually trying to minimize the path cost :')

@hritulagrawal

2 жыл бұрын

What if the weight of the edge represents the distance between two nodes?