Register

Recent questions tagged breadth-first-search

0 votes
0 answers
31
Data structures
Is there any graph whose number of BFS and DFS traversals are different?If so which graph.
Is there any graph whose number of BFS and DFS traversals are different?If so which graph.
User Avatar
0 votes
0 answers
32
DFS BFS
Please give an example i didn't get it The depth of any DFS tree rooted at a vertex is at least as much as the depth of any BFS tree rooted at the same vertex.
Please give an example i didn't get itThe depth of any DFS tree rooted at a vertex is at least as much as thedepth of any BFS tree rooted at the same vertex.
User Avatar
0 votes
2 answers
33
BFS Traversal
How through a BFS we can find graph is connected or disconnected? Plz give some example and explain
How through a BFS we can find graph is connected or disconnected? Plz give some example and explain
User Avatar
4 votes
2 answers
34
ISRO2018-33
Which of the following is application of Breath First Search on the graph? Finding diameter of the graph Finding bipartite graph Both (a) and (b) None of the above
Which of the following is application of Breath First Search on the graph?Finding diameter of the graphFinding bipartite graphBoth (a) and (b)None of the above
User Avatar
2 votes
0 answers
39
NO Of BFS traversal
what is the question asking exactly?
what is the question asking exactly?
User Avatar
0 votes
0 answers
40
BFS traversal sequence
Starting vertex is : $V_1$ Find the BFS traversal sequence
Starting vertex is : $V_1$Find the BFS traversal sequence
User Avatar
0 votes
0 answers
41
BFS algorithm
$State \ TRUE \ OR \ FALSE :\\ Given \ an \ undirected \ connected \ graph \ with \ binary \ edge \ weights \ the \\ shortest \ path \ b/w \ any \ two \ nodes \ can \ be \ found \ in \ O(E)?$
$State \ TRUE \ OR \ FALSE :\\ Given \ an \ undirected \ connected \ graph \ with \ binary \ edge \ weights \ the \\ shortest \ path \ b/w \ any \ two \ nodes \ can \ be ...
User Avatar
0 votes
1 answer
43
TestSeries
Can Bfs be applied for topological sort?
Can Bfs be applied for topological sort?
User Avatar
0 votes
1 answer
45
BFS TRAVERSAL
User Avatar
2 votes
3 answers
46
breadth first search
The max possible height of BFS tree , if BFS is run on a complete bipartite graph Km,n where m>=1 , n>=1 with starting vertex S is
The max possible height of BFS tree , if BFS is run on a complete bipartite graph Km,n where m>=1 , n>=1 with starting vertex S is
User Avatar
0 votes
0 answers
48
Algorithm
User Avatar
0 votes
1 answer
49
BFS algorithm simple question
BFS algo is applied on graph as well as Binary tree. So, is it different for both graph and Binary tree? As on youtube some people showing BFS on graph and some on Binary tree. Kindly clarify, thanks!
BFS algo is applied on graph as well as Binary tree. So, is it different for both graph and Binary tree?As on youtube some people showing BFS on graph and some on Binary ...
User Avatar
10 votes
8 answers
50
ISRO2017-17
Which of the following data structure is useful in traversing a given graph by breadth first search? Stack Queue List None of the above
Which of the following data structure is useful in traversing a given graph by breadth first search?StackQueueListNone of the above
User Avatar
0 votes
1 answer
51
BFS traversal
here S1 ans S2 seems confusing for me can someone help me to varify this answer i think given 3 are true in some case??
here S1 ans S2 seems confusing for me can someone help me to varify this answer i think given 3 are true in some case??
User Avatar
1 votes
1 answer
52
algo + bfs
User Avatar
6 votes
3 answers
54
DS-BFS
a)(d,c) b)(d,b) c)(e,b) d)(e,f)
a)(d,c)b)(d,b)c)(e,b)d)(e,f)
User Avatar
1 votes
1 answer
58
BFS traversal
1.{d,c} 2.{d,b} 3.{e,b} 4.{e,f}
1.{d,c}2.{d,b}3.{e,b}4.{e,f}
User Avatar
0 votes
1 answer
59
BFS Theory
1. Does space complexity includes both input space and extra space needed for algorithm or only extra space? 2.What will be Space complexity for BFS algorithm with adjacency matrix representation? Please reply with supporting references.
1. Does space complexity includes both input space and extra space needed for algorithm or only extra space?2.What will be Space complexity for BFS algorithm with adjacen...
User Avatar
0 votes
1 answer
60
cormen Q
What is the running time of BFS if we represent its input graph by an adjacency matrix and modify the algorithm to handle this form of input?
What is the running time of BFS if we represent its input graph by an adjacency matrix and modify the algorithm to handle this form of input?
User Avatar
Page: