Implementing Dijkstra Algorithm #Graph Algorithms

Timestamps:
0:00 Reading the problem
2:13 Example Walkthrough
13:00 Using Min Heap walkthrough
23:00 Code C++
Given a weighted, undirected, and connected graph of V vertices and E edges, Find the shortest distance of all the vertex's from the source vertex S.
Note: The Graph doesn't contain any negative weight cycle.

[dhananjoydey]

please upload the solution to "Find position of set bit"

[rakeshbaghel]

for(auto x :v){


}

aise likh liya kriye