โ† SAP questions

Explain BFS traversal on a directed graph

Filed under SAP

Given a directed graph represented as an adjacency list and a starting node, return the order of vertices visited using Breadth-First Search (BFS) traversal.

You've read your 3 free write-ups

Sign up free to keep reading. Your account opens the first 10 questions of every company.

Related SAP questions

Collected from public candidate posts and coding forums. Updated Nov 2026.