[MO412] Quizz Question 5 - BFS

About Breadth First Search (BFS) mark the alternative that contains all true statements:

I) The data structure used in standard implementations is a Queue  

II) Can be used to find the shortest path from a source vertice to other vertices in an unweighted graph 

III) Can be used to find all connected components in a undirected graph 

IV) The BFS traversal of a graph will result into a Tree

V) We can use BFS to find all the vertices on any shortest path between a given pair of vertices (a, b) by running two BFS: one starting from a, and other starting from b 

a) only I, II, and IV

b) only I, II, and III

c) only II, III, IV, and V

d) only II, III, and V

e) None of the above 

 

 

Original Idea by: Levy Chaves