Consider a directed graph , where and . Suppose the adjacency list of each vertex is in decreasing order of vertex number, and depth-first search (DFS) is performed at vertex 0. The number of vertices that will be discovered after vertex 50 is ____________(Answer in integer)
GATE DA 2025 — Question 65
Programming, Data Structures and Algorithmsbasic graph algorithms: traversals and shortest pathNAT2 marksHard
A GATE question every morning
One real past-paper question every morning for your branch, answer hidden until you tap. Free on Telegram.
More on basic graph algorithms: traversals and shortest path
- GATE DA 2026 · Q40Consider a directed graph G = (V, E), where V is the finite set of vertices and E is the set of directed edges between the vertices. G may…
- GATE DA 2024 · Q14Consider performing depth-first search (DFS) on an undirected and unweighted graph G starting at vertex s. For any vertex u in G, d[u] is t…
- GATE DA 2024 · Q51Consider the directed acyclic graph (DAG) below: Which of the following is/are valid vertex orderings that can be obtained from a topologic…

