Hi,
We had our first topic stream on graph algorithms yesterday.
Since this was the first stream on this topic, I started with the very basics. We’ll cover more advanced topics in the upcoming streams. My goal is to eventually cover every graph algorithm from basic to advanced. In future streams, I plan to explain some of the hardest graph problems I’ve ever encountered.
If you’re already at an advanced level, the first topic stream is not for you, as I started from the very beginning to ensure that no prior knowledge is needed to follow along.
What is a Graph
In this section, I introduce what a graph is and how it can be useful. I also discuss the basic types of graphs (un/directed, un/weighted).
How to Store a Graph
The next question is how we can take a graph as input and store it. This is the first step we must take before running any algorithm on the graph.
Connectivity in Graphs and DFS
Here, I discuss the connectivity of a graph, and we solve a problem related to it. At the end, I mention that what we did is called DFS.
Solve a 1400 Difficulty Graph Problem from Codeforces
In this section, we solve a graph problem with a difficulty level of 1400 from Codeforces.
The link of the problem: https://mirror.codeforces.com/problemset/problem/505/B
I hope this stream and the consequent ones will be helpful. Feel free to criticize. I'll do my best to address any issues.