Register

Breadth First Search(BFS)

714 views
0 0 votes
$0-1$ $BFS$ (Breadth First Search)al is used to find the shortest distance between two nodes in a graph provided
that the edges in the graph have the weights $0$ or $1.$Which of the following data structure is most efficient
in traversing a graph by $0-1$ $BFS?$
$A)$ Priority queue               $B)$Stack                  $C)$ Double-ended queue                 $D)$ Linked list

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← Previous · Graph SearchNext → · Limit
← Previous in category · Graph SearchNext in category → · GATEBOOK_DS_1_12_Asy...
Position:
Show:

Related questions

0 0 votes
1 1 answer
2.2k
2.2k views
VS asked Nov 26, 2017
2,162 views
Breadth first Search
Consider the following graph G.The BFS traversal on G is modified as : The starting vertex for traversal will be 'a'. At any level (breadth), vertices are visited in alph...
2 2 votes
1 answers 1 answer
1.0k
1.0k views
sushmita asked Oct 3, 2018
1,007 views
general doubt on breadth first search
While doing BFS , at any time in queue suppose there are r vertices v1,v2,v3.....vr with v.d as the distance from the source.Then according to me at any time in a queue,v...
4 4 votes
0 0 answers
5.4k
5.4k views
Na462 asked Aug 21, 2018
5,415 views
Breadth first Search
Which of following statement is true ?A. In BFS of UDG there are no back edges and forward edges.B. In BFS of Directed Graph there is no back edge and forward edges.C. In...
0 0 votes
0 0 answers
991
991 views
akshat sharma asked Mar 21, 2018
991 views
BFS-Breadth first search
State True or False with explanation The depth of a breadth-first search tree on an undirected graph $G = (V, E)$ from an arbitrary vertex $v \in V$ is the diameter of th...