Register
Dark Mode

Breadth first Search

in DS
3,866 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
in DS
by
3.9k views

4 Comments

Show 26 previous comments
by

@Prateek Raghuvanshi 

Thanks Brother all doubts is over by video 

0
0
by
The video is maybe removed now, if someone have this video or link of it please share.
0
0
by
Do you have this video? It is unavailabe now,
0
0

Please log in or register to answer this question.

← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
1 answer
3
VS asked in Algorithms Nov 26, 2017
959 views
Breadth first Search
VS asked in Algorithms Nov 26, 2017
by VS
959 views

Subscribe to GATE CSE 2024 Test Series

Subscribe to GO Classes for GATE CSE 2024

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true

Subjects

64.3k questions

77.9k answers

244k comments

80.0k users

Developed by Chun
Link Copied!