Computer Science · Graph Algorithms
In Breadth-First Search (BFS) traversal of an unweighted graph, the shortest path from the source to any reachable node can be reconstructed using:
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1Adjacency matrix sorting
- 2A Depth-First Search (DFS) recursion stack
- 3Accumulated edge weights
- 4Parent pointers tracked during traversal✓
Correct answer
Parent pointers tracked during traversal
Download Single Question PDF
Save this question and verified answer as a clean study sheet with live clickable link.
👥
Share with Friends & Study Groups
Challenge your peer aspirants on WhatsApp or Telegram to solve this question!
Online Test Series
Start Free Mock Test →Preparing for Computer Science?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
Chapter Practice
Practice Graph Algorithms MCQs →Want more practice questions on Graph Algorithms?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Graph Algorithms