The data structure useful for the breadth first search of a

Report

Report an issue

Name

Email

Message

Submit

Cancel

PGCET CSE Exam (Karnataka) 2011 click here to view all questions

The data structure useful for the breadth first search of a graph is

Astack

Bqueue

Clinked list

Ddequeue

Akilesh Kharvi ? Dec 8 '2016 at 22:11

Answer: queue

Explanation:

BFS starts visiting vertices of a graph at an arbitrary vertex by marking it as
visited.
• It visits graph’s vertices by across to all the neighbors of the last visited vertex
• Instead of a stack, BFS uses a queue

All DiscussionsClick here to write answer

Answer: queue Explanation: BFS starts visiting vertices of a graph at an arbitrary vertex by marking it as visited. • It visits graph’s vertices by across to all the neighbors of the last visited vertex • Instead of a stack, BFS uses a queue Akilesh Kharvi ? answered Dec 8 '2016 at 22:11 All Comments

Post your answers here:

Post

Post your comments here:

Message

Post

Cancel