← Infosys questions

Search and Graph traversal algorithms

Filed under Infosys

Given an undirected graph represented as an adjacency list with V vertices (labeled 0 to V-1) and a starting vertex src, perform a Depth-First Search (DFS) traversal. Return the list of visited…

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 Infosys questions

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