[Video Tutorial Series] Graph Theory: From Beginner to Intermediate - Dardev

general
, ,
6

Thanks! I am glad you are following the series.

Here are the updates:

  1. I solved another CSES problem: Lava Flow and Multisource BFS
    - YouTube

  2. Introduction to Trees, Binary Trees, Min/Max Heaps, Flattening a Tree into a Vector
    - YouTube

  3. I made an introductory video 00 to make things even simpler
    - YouTube

  4. I am reuploading the solution to the first problem, for greater audio clarity and better explanation/presentation
    - YouTube

7 Likes
8

Today I will try and share Dijkstra theory while solving the next CSES problem.

7 Likes
9

Language dependent or independent videos ?

2 Likes
10

I explain concepts in English. But my implementation is in C++, I explain every critical aspect of code though. Just check it out, you’ll like it.

5 Likes
11

This video series is really helpful! I am really excited about this series and will keep posting updates to support you. I just finished the first two videos. Nice explanation of BFS and DFS on the grid.

1 Like
12

Thanks a lot for you effort and hard work. It is really helpful for the coding comminity.

1 Like
13

Thank you guys. Please subscribe! Its a humble request. Will post more videos soon.

3 Likes
14

Hey please try to make a few more videos on Dijkstra algo, with some interesting problems

1 Like
15

Done with Dijkstra:: 09 Graph Theory:: Dijkstra's Algorithm with CSES 08 Shortest Routes I (1671) - YouTube

Do give feedback, please!

5 Likes
16

I updated the Dijkstra’s with more information/explanation/simulation/demonstration! :slight_smile:

3 Likes
17

I will be adding Bellman-Ford and solving more problems starting tomorrow.

You guys can expect a lot more Dijkstra variants too :slight_smile:

Please keep following this series to improve your understanding of graph theory.

1 Like
18

Hey, can you help me with this problem?

19

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)

image

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

1 Like
20


One can also follow this

1 Like
21

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.

3 Likes
22

one of the best graph theory tutorial is by Code N Code

1 Like
23

Floyd-Warshall being uploaded soon! Catch up fast, guys!

2 Likes
24

There is nothing in youtube that is as good as this channel when it comes to graph theory.
thank you.

1 Like
25

Floyd-Warshall for All Source Shortest Path
And solution for Shortest Routes II

1 Like
26

I am weak at graph
Hope this is help me alot