Breadth First Search in C++

Prerequisites : Adjacency List, Queue data structure(FIFO)
Breadth First Search :
Like DFS, BFS is another form of Graph traversal Algorithm. Instead of going deeper and deeper, unlike DFS it goes in breadth first faishon which means that if it is on node u currently, then it first visits all the neighbours of node u and then the same thing happens with each of its neighbours. Lets understand how this algorithm works with the help of an example.

Topological sort on a directed acyclic graph

Contents:

1. What is Topological Sorting ?
2. Illustration with the help of an example.
3. Implementation of topological sort in C++.

Finding connected Components using DFS in C++

Contents :

1. Pre-requisites
2. Understanding connected components.
3. Implementing DFS to find number of connected components.

Depth First Search in C++

Hey Guys ! Hope you are doing well !
In my previous post i wrote about implementation of Adjacency List in C++. So if you don't know how to implement Adjacency List in C++, you must read this post.

---

Depth First Search

DFS (in short) is a simple algorithm to traverse a graph.

Graph : Adjacency List using STL in C++ for competitve programming

CONTENTS :

1. Introduction to Adjacency List.
2. Some STL Componenets required to make Adjacency List:
• Vector
• Pair
• Map
3. Implementation in C++.