Register

Breadth first Search

3,960 views
4 votes
4 votes
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
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

627
views
1 answers
2 votes
sushmita asked Oct 3, 2018
627 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 ... d=v1.d+1But in cormen its written that v2.d<=v1.d+1Can someone please explain?
User Avatar
476
views
0 answers
0 votes
Lakshman Bhaiya asked Nov 13, 2018
476 views
Breadth First Search(BFS)
$0-1$ $BFS$ (Breadth First Search)al is used to find the shortest distance between two nodes in a graph providedthat the edges in the graph have the weights $0$ or $1.$Which of ... $C)$ Double-ended queue $D)$ Linked list
User Avatar
1.1k
views
1 answers
0 votes
VS asked Nov 26, 2017
1,128 views
Breadth first Search
User Avatar
717
views
0 answers
0 votes
akshat sharma asked Mar 21, 2018
717 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 ... every pair of vertices $s$ and $t$ have $\delta(s, t) \leq d$)
User Avatar
Link Copied!