Dijkstra Algorithm Coding C++ | Shortest Path | Implementation | Graphs | Greedy

Get the source code here :

📜My Playlists :

Dynamic Programming Deep Dive :
Bits Of Javascript :
Trees Playlist :
Superuser Space :
Graphs Playlist :

🧿My Channels :

🎸"Tuning Folks" , channel for Music Content :

💻"Friendly Developer" , channel for Technical Content :

💚💌 Please leave a LIKE and SUBSCRIBE for more content!

Suggested Videos :

[teetanrobotics]

I feel that this YouTube channel has the potential to be one of the best competitive coding channels on entire YouTube. Could you please organize all the videos of your channel into respective playlists ? Again thank you for your amazing service.

[saif]

You're the ONLY one who actually showed me how to code Dijistra's algorithm. Everybody else (including my lecturers) just spent 20 minutes explaining how they would do it, how it works, but never got around to actually explaining correct how to do it. Ty so much! I have a working Dijkstra's algorithm now and I can begin studying this thing and utilizing it for my other projects. Thanks again!

[biancaa-ramesh]

You literally saved me...I was crying because I didnt understand this for the lab exam...but now I get it..Thanks<3

[swrhsn]

the way you explained it, it took me just half an hour to code it ... respect

[poCenilnO]

I believe there's a small typo in the input values shown in the (commented) section of code.

The image shown at 2:07 has no link from node 7 back to node 0. The inputs in the (commented) code at 2:10 have a value of '8' in [0][7] and [7][0].
According to the image, those should be '0'.

Also, the values for [1][7] (value of '8') and [7][1] (value of '11') should be the same (the image shows there's a weight of '8' between nodes 1 and 7).

[Tejs_]

Wow bro this is a unique and different way of teaching, it just teaches dijkstra along with how to code, its very diff from other videos on yt

[lac]

NIce work bro. I recently went over Dijkstra algo from my algorithms course but was having issues with the implementation. Thanks!

[bongisiphomntambo]

This is the best and easiest implementation which I have come across thus far!!

[brionesalbertjr]

How can I have my cost matrix be placed in the code already, and not needing the user to input it?

[aniket]

Great video man.Thank u for the video cuz it explains pretty much better as the other videos on YT were not code specific. 😁👍Glad to find your channel. Please guide and upload DS based code videos !!! Thanks Again.😘

[mohnish.deshpande]

You are talented bro!!!
I am an Aussie-Indian and have massive respect for such bright/smart Indian guys.

[kirkb]

For your display function, on line 50, add \n after cout<<"Node:\t\t\tCost :\t\t\tPath"; to get it to display correctly.
Like this:
cout<<"Node:\t\t\tCost :\t\t\tPath\n";

[TheOfficialnF]

Please consider uploading source code in next tutorials. It's a real hassle having to scroll through the video for finding one line. Other than that, perfect video!

[mikehuang]

Isn't is better to use a priority queue which has a time complexity of O(log n) removal and retrieval time instead of iterating through all elements to get a O(n) time complexity? If you would use a priority queue it would therefore run faster and where wouldn't be so much to code. Apart from that the video is pretty neat!

[Tomab]

Why would you write C++ as if you write plain old C ?

[Oounayo]

Hi. When I put in the number of vertices - ->9, I don't get any output. Same code and all. Do you know what could be wrong?

[matviyberezovskiy]

Nothing happens after I entered a cost matrix, the source code line isn't showing. How could I fix that?

[tusharjain]

Hey, excellent work, when will you upload videos on all the algorithms like prims, pathfinding etc pls tell

[kumaraditya]

i am not able to understand the ( int get Nearest) great video

[adarshsrivastava]

bro can u explain why in while loop parnode=parent[parnode];