# Getting Started with Competitive Programming

(*an NPTEL course)*

Home ⸱ Quick Links ⸱ Grading Policy ⸱ References ⸱ FAQ ⸱ Feedback ⸱ Connect ⸱ Credits

## Module 1. BFS/DFS Foundations

This lecture is divided into two segments. In the first part, we introduce the notion of graphs and describe two popular ways in which you can represent a graph - the adjacency matrix and adjacency list representations, with a brief discussion of the pros and cons of both options.

In the second part, we explain the BFS and DFS traversals, focusing mostly on the implementations. To try out the traversals yourself, you can try out this module on Visualgo.

Learn more about graph representations and traversals in this book chapter.

Further, you can find the code discussed in the video on the Competitive Programming book repository:

You can find out more about applications of BFS and DFS in the following video:

and you can learn about topological sort here:

`super-embed:<div id="hyvor-talk-view"></div><script async defer type="text/javascript" src="//talk.hyvor.com/web-api/embed.js"></script>`