Time left

Question $4$

Answer saved

Marked out of $1\mathrm{.}00$

F Flag question

Concerning the output of the breadth$-$first search algorithm, one of the following statements is true

a The output contains all edges of the input graph

b$.$ The path to each reachable node from the source node is simple and unique

c The output is a forest of at least one tree.

d$.$ The output contains all nodes of the input graph

Previous page

Nex