Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Recent questions tagged breadth-first-search
0
votes
1
answer
1
#Dfs And Bfs
Please list the problems where BFS alone can do and DFS alone can do and both can do??
Subbu.
asked
in
Algorithms
Jul 16
by
Subbu.
109
views
algorithms
breadth-first-search
depth-first-search
0
votes
0
answers
2
Self Doubt - BFT Applications
Can we use BFT for finding no. of connected components in a directed as well as undirected graph?
Vallari Garg
asked
in
DS
May 17
by
Vallari Garg
119
views
breadth-first-search
0
votes
1
answer
3
UGC NET CSE | October 2020 | Part 2 | Question: 63
Which of the following statements are true? Minimax search is breadth-first; it processes all the nodes at a level before moving to a node in next level. The effectiveness of the alpha-beta pruning is highly dependent on the order in which the states are examined The alpha- ... $(a)$ and $(d)$ only $(b)$ and $(c)$ only $(c)$ and $(d)$ only
go_editor
asked
in
DS
Nov 20, 2020
by
go_editor
1.5k
views
ugcnetcse-oct2020-paper2
data-structures
breadth-first-search
0
votes
1
answer
4
NIELIT 2017 July Scientist B (IT) - Section B: 4
What are the appropriate data structures for graph traversal using Breadth First Search(BFS) and Depth First Search(DFS) algorithms? Stack for BFS and Queue for DFS Queue for BFS and Stack for DFS Stack for BFS and Stack for DFS Queue for BFS and Queue for DFS
Lakshman Patel RJIT
asked
in
DS
Mar 30, 2020
by
Lakshman Patel RJIT
970
views
nielit2017july-scientistb-it
data-structures
graph-algorithms
breadth-first-search
depth-first-search
1
vote
3
answers
5
ISRO2020-32
$G$ is an undirected graph with vertex set $\{v1, \ v2, \ v3, \ v4, \ v5, \ v6, \ v7\}$ and edge set $\{v1v2,\ v1v3,\ v1v4\ ,v2v4,\ v2v5,\ v3v4,\ v4v5,\ v4v6,\ v5v6,\ v6v7\ \}$. A breadth first search of the graph is performed with $v1$ as the root node. Which of the following is a tree edge? $v2v4$ $v1v4$ $v4v5$ $v3v4$
Satbir
asked
in
DS
Jan 13, 2020
by
Satbir
2.1k
views
isro-2020
data-structures
breadth-first-search
normal
0
votes
1
answer
6
Cormen Edition 3 Exercise 22.2 Question 8 (Page No. 539)
The diameter of a tree $T= (V, E)$ is defined as $max_{u,v\ \epsilon\ V}\ \delta(u,v)$, that is, the largest of all shortest-path distances in the tree. Give an efficient algorithm to compute the diameter of a tree, and analyze the running time of your algorithm.
KUSHAGRA गुप्ता
asked
in
Algorithms
Nov 12, 2019
by
KUSHAGRA गुप्ता
454
views
cormen
graph-algorithms
breadth-first-search
descriptive
1
vote
1
answer
7
Cormen Edition 3 Exercise 22.2 Question 7 (Page No. 539)
There are two types of professional wrestlers: babyfaces ( good guys ) and heels ( bad guys ). Between any pair of professional wrestlers, there may or may not be a rivalry. Suppose we have n professional wrestlers and we ... between a babyface and a heel. If it is possible to perform such a designation, your algorithm should produce it.
KUSHAGRA गुप्ता
asked
in
Algorithms
Nov 12, 2019
by
KUSHAGRA गुप्ता
660
views
cormen
graph-algorithms
breadth-first-search
descriptive
1
vote
1
answer
8
Cormen Edition 3 Exercise 22.2 Question 6 (Page No. 539)
Give an example of a directed graph $G=(V, E)$, a source vertex $s\ \epsilon\ V$ , and a set of tree edges $E_{\Pi}\subseteq E$ such that for each vertex $v\ \epsilon\ V$ ... set of edges $E_{\Pi}$ cannot be produced by running BFS on G, no matter how the vertices are ordered in each adjacency list.
KUSHAGRA गुप्ता
asked
in
Algorithms
Nov 12, 2019
by
KUSHAGRA गुप्ता
654
views
cormen
breadth-first-search
graph-algorithms
descriptive
1
vote
2
answers
9
BFS traversal path
What will be the path from A-H if BFS is used in the following graph?
saptarshiDey
asked
in
Algorithms
Feb 2, 2019
by
saptarshiDey
456
views
graph-algorithms
algorithms
breadth-first-search
1
vote
0
answers
10
BFS and DFS - types of edges
Can someone please explain what are the types of edges possible in BFS and DFS for DIRECTED as well as UNDIRECTED graphs? Individual meaning of BACK, FRONT and CROSS edges is clear, but can’t decide which are present and which are not for Traversals. an example would be of great help or any specific reference on this.
Markzuck
asked
in
Algorithms
Dec 30, 2018
by
Markzuck
1.0k
views
depth-first-search
breadth-first-search
algorithms
graph-algorithms
0
votes
1
answer
11
BFS problem
True or False , with reason. For a directed graph, the absence of back edges with respect to a BFS tree implies that the graph is acyclic? Answer is False Explanation: FALSE. It is true that the absence of back edges with respect to a DFS tree ... a cycle using such cross edges (which decrease the level) and using forward edges (which increase the level) Can someone explain it ?
Sandy Sharma
asked
in
Algorithms
Dec 25, 2018
by
Sandy Sharma
933
views
algorithms
graph-algorithms
breadth-first-search
true-false
0
votes
1
answer
12
ME OTS
Are the "n!" ways maximum possible BFS sequences ? ( Indirectly, for any given vertices is it obvious that complete graph will give max BFS sequences ? )
HeadShot
asked
in
Algorithms
Nov 30, 2018
by
HeadShot
137
views
algorithms
graph-algorithms
breadth-first-search
numerical-answers
made-easy-test-series
1
vote
0
answers
13
Algorithm Back Edges
Does Back Edges in both BFS and DFS leads to cycle in a directed graph? Please elaborate.
Shamim Ahmed
asked
in
Algorithms
Nov 26, 2018
by
Shamim Ahmed
274
views
algorithms
breadth-first-search
depth-first-search
0
votes
1
answer
14
Edge-Classification In DIrected Graph using BFS
In BFS of a directed graph, we don't have forward edges.Only tree edge,cross edge or back edge. Below is a sample graph I have taken and classified edge types. Please verify guys whether it's correct. The ... in the selected answer here. https://stackoverflow.com/questions/29631211/edge-classification-during-breadth-first-search-on-a-directed-graph
Ayush Upadhyaya
asked
in
Programming
Nov 22, 2018
by
Ayush Upadhyaya
2.5k
views
graph-algorithms
breadth-first-search
0
votes
1
answer
15
BFS TRAVERSAL
HOW CAN WE GET A CROSS EDGE WHILE PERFORMING A BFS ON UNDIRECTED AND DIRECTED GRAPH CAN ANYONE SHOW WITH AN EXAMPLE?
codingo1234
asked
in
Programming
Nov 21, 2018
by
codingo1234
215
views
breadth-first-search
algorithms
graph-algorithms
0
votes
0
answers
16
Breadth First Search(BFS)
$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
Lakshman Patel RJIT
asked
in
Algorithms
Nov 13, 2018
by
Lakshman Patel RJIT
291
views
algorithms
graph-algorithms
breadth-first-search
0
votes
0
answers
17
BFS TREE EDGES
WHAT ARE THE VARIOUS EDGES POSSIBLE DURING BFS ?
eyeamgj
asked
in
Algorithms
Oct 29, 2018
by
eyeamgj
177
views
breadth-first-search
0
votes
1
answer
18
BFS Traversal
Maximum number of BFS Traversal Possible on BST of height 3 is ..........
Na462
asked
in
Programming
Oct 21, 2018
by
Na462
545
views
breadth-first-search
algorithms
data-structures
2
votes
1
answer
19
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?
sushmita
asked
in
DS
Oct 3, 2018
by
sushmita
377
views
breadth-first-search
data-structures
graph-algorithms
0
votes
1
answer
20
back edge and no forward edge
Which does this sentence mean? In BFS of an undirected graph, there are no back edge and no forward edge.
syncronizing
asked
in
DS
Aug 23, 2018
by
syncronizing
1.8k
views
programming-in-c
data-structures
breadth-first-search
4
votes
0
answers
21
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
Na462
asked
in
DS
Aug 21, 2018
by
Na462
3.2k
views
breadth-first-search
data-structures
graph-algorithms
0
votes
0
answers
22
Twin Pointer
Anyone, please explain briefly! Applying BFS on the undirected graph gives you twin pointer.
syncronizing
asked
in
Algorithms
Aug 21, 2018
by
syncronizing
360
views
breadth-first-search
twin-pointer
0
votes
0
answers
23
Data structures
Is there any graph whose number of BFS and DFS traversals are different?If so which graph.
AIkiran01
asked
in
Programming
Aug 5, 2018
by
AIkiran01
302
views
breadth-first-search
data-structures
0
votes
0
answers
24
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.
Rishav Kumar Singh
asked
in
Algorithms
Aug 2, 2018
by
Rishav Kumar Singh
494
views
depth-first-search
breadth-first-search
algorithms
0
votes
2
answers
25
BFS Traversal
How through a BFS we can find graph is connected or disconnected? Plz give some example and explain
srestha
asked
in
Algorithms
Jun 30, 2018
by
srestha
529
views
breadth-first-search
algorithms
graph-algorithms
2
votes
2
answers
26
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
Arjun
asked
in
Algorithms
Apr 22, 2018
by
Arjun
3.0k
views
isro2018
graph-algorithms
breadth-first-search
algorithms
0
votes
0
answers
27
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$)
akshat sharma
asked
in
DS
Mar 21, 2018
by
akshat sharma
607
views
breadth-first-search
data-structures
6
votes
1
answer
28
Back edge,tree edge,forward edges in BFS
Consider the following statements: 1. Let T be the DFS tree resulting from DFS traversal on a connected directed graph the root of the tree is an articulation point, iff it has at least two children. 2. When BFS is carried out on a directed ... back edge, or cross edge and not forward edge as in the case of DFS. Find TRUE or FALSE for both the statements
MIRIYALA JEEVAN KUMA
asked
in
DS
Jan 27, 2018
by
MIRIYALA JEEVAN KUMA
10.3k
views
algorithms
breadth-first-search
depth-first-search
graph-algorithms
programming-in-c
data-structures
1
vote
1
answer
29
BFS- No of Teversals
How to solve these kind of questions?
Shubham Kumar Gupta
asked
in
DS
Jan 17, 2018
by
Shubham Kumar Gupta
583
views
breadth-first-search
algorithms
data-structures
graph-algorithms
Page:
1
2
next »
Subscribe to GATE CSE 2023 Test Series
Subscribe to GO Classes for GATE CSE 2023
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
Recent Posts
Life happens, just chill and do hardwork
ISRO RECRUITMENT FOR SCIENTIST B THROUGH GATE
POWER GRID CORPORATION OF INDIA LIMITED
INSTITUTE OF BANKING PERSONNEL SELECTION
GATE Overflow books for TIFR, ISRO, UGCNET and NIELIT
Subjects
All categories
General Aptitude
(2.4k)
Engineering Mathematics
(9.1k)
Digital Logic
(3.2k)
Programming and DS
(5.8k)
Algorithms
(4.5k)
Theory of Computation
(6.6k)
Compiler Design
(2.3k)
Operating System
(4.9k)
Databases
(4.5k)
CO and Architecture
(3.7k)
Computer Networks
(4.5k)
Non GATE
(1.3k)
Others
(2.4k)
Admissions
(648)
Exam Queries
(841)
Tier 1 Placement Questions
(17)
Job Queries
(74)
Projects
(9)
Unknown Category
(855)
Recent questions tagged breadth-first-search
Recent Blog Comments
@GO Classes @Deepak Poonia @Sachin...
@GO Classes @Deepak Poonia sir...
Maximum age limit changed from 35 yrs. to 28...
Hmm, sir totally getting your point ☺️☺️....
yes, that's fine. But saying so in a public forum...