Question 16554 – TIFR PHD 2022
November 12, 2023Question 11223 – Graphs-and-Tree
November 12, 2023Graphs-and-Tree
|
Question 5
|
Breadth first traversal is a method to traverse
|
All successor of a visited node before any successors of any of those successors
|
|
|
A single path of the graph as far it can go
|
|
|
Graph using shortest path
|
|
|
None of these
|
Question 5 Explanation:
Breadth first traversal is a method to traverse all successor of a visited node before any successors of any of those successors.
Correct Answer: A
Question 5 Explanation:
Breadth first traversal is a method to traverse all successor of a visited node before any successors of any of those successors.