Graphs for CP: No Pre-requisites! Simplified Explanation

Описание

In this lecture, the aim is to develop an intuitive understanding about graphs and learn about how to represent graphs in computer programs, and two of the main graph algorithms - BFS and DFS or Breadth First Search and Depth First Search.

This lecture is very important for you if you are into competitive programming or you want to learn about DSA in general.
Subscribe for more content!

Link to slides: https://docs.google.com/presentation/d/1QNMbZQcJNHm1e5-1xpXLUxkQ5fFF9FGeYNdbZDvodFo/edit?usp=drivesdk
Timestamps will be added upon premeire.