Search⌘ K
AI Features
Home
Courses
Algorithms for Coding Interviews in C++

Challenge: Implement Breadth First Graph Traversal

Explore how to implement the Breadth First Search traversal in C++ graphs. Understand the algorithm's step-by-step process to visit nodes systematically using adjacency lists. This lesson prepares you to handle graph traversal challenges commonly found in coding interviews.

We'll cover the following...

Problem Statement

You have to implement the Breadth-First Traversal in C++.

Input

A graph represented as an adjacency list and a starting vertex.

Output

A string containing the vertices of the graph listed in the correct order of traversal.

Sample Input

Graph:

graph = {0 -> 1
         1 -> 2
         1 -> 3
         2 -> 4
         3 -> 4
         3 -> 5}

Sample Output

"0 1 2 3 4 5";

Print Left Child first and then Right Child!

Coding Exercise

Take a close look and design a step-by-step algorithm before jumping on to implementation. This problem is designed for your practice, so try to solve it on your own first. If you get stuck, you can always refer to the hint and solution provided in the code tab. Good Luck!

C++
#include "Graph.h"
void Graph::breadthFirstTraversal(int source) { 
	// write your code here
  cout << " ";
}