Computer Science, asked by abhaykd2017, 1 year ago

Which of the following is useful in traversing a given graph by breadth first search?
Stack
Set
List
Queue

Answers

Answered by mirriam

0

Answer:

Queue

Explanation:

Previous Question

Next Question

Similar questions

English, 6 months ago

Change into Degrees of degrees of comparison : I earn as much money as ram ...

Physics, 6 months ago

A student want to project the image of a candle flame on a screen kept at 90cm infront of a mirror by keeping the flame at a distance of 15cm from its pole. Find the distance between the object and the image ...

Math, 6 months ago

An angle of goº is called angle...

Math, 1 year ago

5-7x /2(1+2x) = -8/7 ...

Computer Science, 1 year ago

Which of the following statement is true ? Optimal binary search tree construction can be performed efficiently using dynamic programming. Breath first search cannot be used to find converted components of a graph. Given the prefix and post fix walks over a binary tree.The binary tree cannot be uniquely constructe Depth first search can be used to find connected components of a graph.

Sociology, 1 year ago

nukkad natak on raksha Bandhan..I need a script...

English, 1 year ago

hey guys.... what is the meaning of the word pungent?? any one plz answer...

Math, 1 year ago

find the area of a triangle whose sides are 34 centimetre 20 cm and 42 cm find the length of the altitude corresponding to the shortest side...