Question: In Breadth - First Search ( BFS ) , which data structure is typically used to keep track of the vertices that have been discovered

In Breadth-First Search (BFS), which data structure is typically used to keep track of the vertices that have been discovered but not yet finished?
Stack
Queue
Array
List

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Programming Questions!