Skip to content
Early access — you're among the first to try PYQLabs. Share feedback
Concept drill

discovery-time

GATE CSE & IT · Graph Algorithms · 2006-2026

2
PYQs
100%
keyed
1
elite explanations
2
years appeared

Study anchor

Cormen et al. — Introduction to Algorithms (CLRS)

Algorithms, data structures, graph algorithms, complexity

Practice action

Start latest PYQ

PYQs in this concept

All concepts →
2026 PYQ

Consider the following pseudocode for depth-first search (DFS) algorithm which takes a directed graph $G(V, E)$ as input, where $d[v]$ and $f[v]$ are the discovery time and finishi...

mediumanswer keyelite explanation
2006 PYQ

Consider the depth-first-search of an undirected graph with 3 vertices P, Q, and R. Let discovery time d(u) represent the time instant when the vertex u is first visited, and finis...

mediumanswer key