Dijkstra's Algorithm with Code[C++] - Prateek Narang | Coding Blocks

Code - codingblocks.c...
Check courses on - online.codingbl... [Free Trial Available]
Coding Blocks is pleased to announce courses like C++ and Java, Data Structures and Algorithms, Web and Android Development(Java and Kotlin), Competitive Programming, Coding Interview Preparation and Machine Learning, AI and more.
#CodingBlocks #ProgrammingMadeEasy #LearnCodingOnline
Like our FaceBook Page - / codingblocksindia
Follow us on Instagram - / codingblocks
Follow us on Twitter - / codingblocksin
Source code available on -github.com/cod...
For more interesting tutorials - / @codingblocksindia

[@shivamkumar-qp1jm]

finally i can implement dijkstra algorithm in c++ using stl now feeling nice

[@WeViral121]

great video! I had Learned dijkstra's algorithm but was unable to implement it in c++! thanks :), great explaination and loved the code.

[@milindphalke4369]

It was a very nice explanation for Dijkstra and loved the way you implemented.

[@INNOVATIVEAPPROACH]

Bro hardwork seen by way of presenting the code and concept...

[@vipingautam1400]

this was not so tricky but implementation was too hard ,you made it clear to me thanks

[@manjotkaur9070]

Thanku so much Prateek sir...your way of explaining is really simple and easy to understand 🙏🙏🙏

[@rachitjain3257]

s.begin() is a pointer and *s.begin() will give u a pair

[@Gandhiboy]

Best video on the topic on the whole internet 🤩

[@vovchicplagov]

I also created a map visited and when you check for the path to be shorter I also ask if it is not visited. In this case it won`t be added to our set and dist map and you do not have to look for a pair in the set. Makes it easier to understand the algorithm. The part with the finding and erasing the pair from the set was confusing.

[@biswajitsahoo1456]

bro the last portion of erasing and finding is a little bit confusing can u send me your code that might help me out.

[@vovchicplagov]

​@@biswajitsahoo1456 ​ check out your channel discussion

[@rachitjain3257]

13:00- algorithm

[@shikharagrawal3424]

Thanks a lot sir.. It is really helpful.

[@sanjeevkumar-je5yt]

Thank you so much! my whole college cse student see your you tube channel

[@codeguy21]

Hmm

[@pasitopasito1967]

Thanx to provide some video freeof cost..

[@eshuyadav7219]

Thank you sir for providing these important stuff please implement prim,kruskal

[@shubhamjaiswal1325]

Coding blocks you are just awesome

[@The_Helping_Hand_1997]

thanks sir you are great your explanation is very good ....

[@poonamkhopade9028]

Code is not opened

[@navneetshukla5582]

This code is not giving correct output

[@vipingautam1400]

thanks for the video bhai

[@saurabhmishra8356]

It's amazing, Thank you so much :)

[@vaibhavgupta973]

nice !!

[@akashparihar2063]

Awesome bro 🔥🔥🔥🔥🔥

[@vkvaibhavkumarvk]

Thank you for this

[@Raghav_362]

but when set was sorted ?plz tell

[@codinggems9973]

this algo is not working for directed disconnected graph

[@mishraabhyuday]

Shouldn't there be a visited array if I want to have a parent array, as then the neighbour which is a parent would be visited again and parent array would be updated wrongly??

[@ankushbhardwxj]

Very hard to follow the explanation of the implementation.

[@IndieDeveloperGuy]

please tell more clearly, how will i know the exact path?

[@miguelprincipegoods1906]

I need this same code, but in Visual Basic Excel. I intend to formalize a DATAMATRIX of distance between streets or houses in a city. Very urgently .. It is Dijkstra Algorithm.

[@abkyabacha]

A small mistake at 0:48, when you say it's the algorithm for a graph with no negative weight cycle. It should be algo for a graph with non-negative edge

[@tusharahooja691]

The negative edges are considered. If from our current node we can reach an already visited node via negative edge, we again visit our already visited node. But for negative edge cycle it fails as for each cycle iteration we can a smaller path

[@sakshigupta2315]

what is the complexity of this algo

[@prasantkumar32]

ElogE

[@devkalavadia7529]

@@prasantkumar32 are u sure?

[@securityintech]

set cannot have duplicate values, right? so we can use multiset here, i think so

[@shubho5das]

Every node has a Unique Value. You cannot have 2 "Amritsar"s on a Map, right? 😄

[@zyro9922]

The explanation was not that great but implementation was amazing.

[@bbgakhar5075]

Uuo up

[@thiyagus6829]

can you please explain a path also in a form of code bro

[@infinix_11]

There is no coherence between explanation and code.

[@ІлиясКарибай]

oohh guys i need source code! can u send me on comments or "Admin: pls give me code on description " ty for ur attention

[@CodingBlocksIndia]

Code - codingblocks.com/ide/#/s/3059

[@mishraabhyuday]

Nice explanation otherwise

[@souvikdas2759]

Not like other videos...very poorly explained. This needs to be updated