Register

Breadth First Search(BFS)

451 views
0 votes
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
User Avatar

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
1 answer
1
VS asked Nov 26, 2017
991 views
Breadth first Search
User Avatar
2 votes
2 votes
1 answer
2
sushmita asked Oct 3, 2018
597 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, v1.d=v2.d or v2.d=v1.d+1 But in cormen its written that v2.d<=v1.d+1 Can someone please explain?
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...
User Avatar
4 votes
4 votes
0 answers
3
Na462 asked Aug 21, 2018
3,852 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 BFS of UDG for each back edge(u,v) we have 0<= v.d <= u.d D. Both b and c. Ans. A
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...
User Avatar
0 votes
0 votes
0 answers
4
akshat sharma asked Mar 21, 2018
699 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 the graph $G$. (The diameter $d$ of a graph is the smallest $d$ such that every pair of vertices $s$ and $t$ have $\delta(s, t) \leq d$)
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...
User Avatar
Link Copied!