Thank you guys. Please subscribe! Its a humble request. Will post more videos soon.
Hey please try to make a few more videos on Dijkstra algo, with some interesting problems
Done with Dijkstra:: 09 Graph Theory:: Dijkstra's Algorithm with CSES 08 Shortest Routes I (1671) - YouTube
Do give feedback, please!
I updated the Dijkstra’s with more information/explanation/simulation/demonstration!
I will be adding Bellman-Ford and solving more problems starting tomorrow.
You guys can expect a lot more Dijkstra variants too
Please keep following this series to improve your understanding of graph theory.
Hey, can you help me with this problem?
Check out my DFS
void dfs(int u)
{
for(idx[u]; idx[u] < g[u].size(); idx[u]++)
{
int v = g[u][idx[u]];
int x = u;
int y = v;
if(x > y)
{
swap(x,y);
}
if(edge[x].find(y) == edge[x].end()) continue;
edge[x].erase(y);
--degree[u];
--degree[v];
dfs(v);
}
stck.push(u);
}
See what i did there? I created a global vector idx and did the following to track the edge being currently explored.
for(idx[u]; idx[u] < g[u].size(); idx[u]++)
When I come back, I don’t start checking ALL neighbours of vertex ‘u’. I simply continue from where I left. Hope that makes sense?
If we don’t take care of this, we will search ALL edges every time in the following case. I am calling this graph a flower-with-petal graph. Only seven petals in this graph, but imagine what happens if there are 10^5 petals (with O(N^2) complexity)
If it doesn’t I am not going to type out more here. I try to make a Eulerian Circuit video on priority and explain this aspect clearly.
Watch out for this video series: - YouTube
One can also follow this
Hey guys! Just solved another problem for you guys: High Score and this time we study the “Bellman-Ford” Algorithm.
Hope you’ll love it.
one of the best graph theory tutorial is by Code N Code
Floyd-Warshall being uploaded soon! Catch up fast, guys!
There is nothing in youtube that is as good as this channel when it comes to graph theory.
thank you.
I am weak at graph
Hope this is help me alot
It will. Just follow the series. I promise you will get better. And please don’t name call Chandan da. He is also an aspirant of knowledge like you and I. Peace to you!
Thanks Brother
Another video on Dijkstra.
The next video will be on Dijkstra too. It will be much shorter. And you will be really comfortably with Dij by then!
Hello dardev, thank you very much, for the work that you have done and put together a truely second to none playlist of graph theory please consider making one for dynamic programming as well
Thanks! One thing at a time.
I will finish graph series; then dynamic programming will be started. I have loads of good ideas for DP too (since its one of my stronger subjects)!
Subscribe to stay notified.
One more Dijkstras coming up this evening! Already done, but am releasing it in the evening! <3