← SAP questions

Breadth-First Search in a graph

Filed under SAP

Given an undirected or directed graph represented as an adjacency list and a starting source node, perform a Breadth-First Search (BFS) traversal visiting all reachable vertices level by level…

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.