Question
Download Solution PDFBreath first traversal of a graph uses representation of graph in which data structure ?
Answer (Detailed Solution Below)
Detailed Solution
Download Solution PDFThe correct answer is option 1: queue
Key Points
- Breadth First Traversal (BFS) is a graph traversal technique that visits all the vertices of a graph in breadthward motion, i.e., level by level.
- BFS uses a queue data structure to keep track of the vertices that need to be explored next.
- Once a node is visited, all of its adjacent unvisited vertices are added to the queue.
Additional Information
- Stack is used in Depth First Search (DFS), not BFS.
- List or doubly linked list may be used for adjacency representation but not directly for traversal control in BFS.
- Queue ensures FIFO order, which is essential for BFS to maintain level-order traversal.
Therefore, the correct answer is: option 1: queue
Last updated on Jun 12, 2025
-> NIELIT Scientific Assistant city intimation slip 2025 has been released at the official website.
-> NIELIT Scientific Assistant exam 2025 is scheduled to be conducted on June 28.
-> A total number of 113 revised vacancies have been announced for the post of Scientific Assistant in Computer Science (CS), Information Technology (IT), and Electronics & Communication (EC) streams.
-> Online application form, last date has been extended up to from 17th April 2025.
->The NIELT has revised the Essential Qualifications for the post of Scientific Assistant. Candidates must possess (M.Sc.)/ (MS)/ (MCA) / (B.E.)/ (B.Tech) in relevant disciplines.
-> The NIELIT Scientific Assistant 2025 Notification has been released by the National Institute of Electronics and Information Technology (NIELIT).