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 depth-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.
82
views
algorithms
breadth-first-search
depth-first-search
1
vote
1
answer
2
NIELIT 2016 DEC Scientist B (IT) - Section B: 30
What data structures is used for depth first traversal of a graph? Queue Stack List None of the above
Lakshman Patel RJIT
asked
in
DS
Mar 31, 2020
by
Lakshman Patel RJIT
569
views
nielit2016dec-scientistb-it
data-structures
stack
depth-first-search
2
votes
2
answers
3
NIELIT 2016 DEC Scientist B (IT) - Section B: 42
In the ________ traversal we process all of a vertex's descendants before we move to an adjacent vertex. Depth First Breadth First Width First Depth Limited
Lakshman Patel RJIT
asked
in
DS
Mar 31, 2020
by
Lakshman Patel RJIT
1.5k
views
nielit2016dec-scientistb-it
data-structures
stack
depth-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
932
views
nielit2017july-scientistb-it
data-structures
graph-algorithms
breadth-first-search
depth-first-search
0
votes
1
answer
5
NIELIT 2017 July Scientist B (IT) - Section B: 5
In a given following graph among the following sequences: abeghf abfehg abfhge afghbe Which are depth first traversals of the above graph? I,II and IV only I and IV only II,III and IV only I,III and IV only
Lakshman Patel RJIT
asked
in
Graph Theory
Mar 30, 2020
by
Lakshman Patel RJIT
503
views
nielit2017july-scientistb-it
discrete-mathematics
graph-theory
depth-first-search
1
vote
1
answer
6
UGC NET CSE | June 2019 | Part 2 | Question: 65
Which of the following is application of depth-first search? Only topological sort Only strongly connected components Both topological sort and strongly connected components Neither topological sort nor strongly connected components
Arjun
asked
in
Algorithms
Jul 2, 2019
by
Arjun
1.3k
views
ugcnetcse-june2019-paper2
depth-first-search
1
vote
0
answers
7
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
982
views
depth-first-search
breadth-first-search
algorithms
graph-algorithms
1
vote
1
answer
8
Which of the following condition is sufficient to detect cycle in a directed graph?
Which of the following condition is sufficient to detect cycle in a directed graph? (A) There is an edge from currently being visited node to an already visited node. (B) There is an edge from currently being visited node to ... seen twice in DFS. (D) None of the bove here option B is right, but why not option A?
Gangani_Son
asked
in
Algorithms
Dec 12, 2018
by
Gangani_Son
11.7k
views
graph-theory
depth-first-search
geeksforgeeks-test-series
graph-algorithms
0
votes
1
answer
9
which DFS algorithm to follow?
there are multiple algorithm of DFS available and i cant figure out which one to follow for solving question asking for the nodes which aren't pushed into the stack or the nodes which are pushed more than once, Tried to figure out from ... , https://gateoverflow.in/98484/dfs-using-stack https://gateoverflow.in/161225/dfs-number-of-nodes-not-pushed-into-the-stack
Shivam Kasat
asked
in
Algorithms
Dec 9, 2018
by
Shivam Kasat
300
views
depth-first-search
algorithms
graph-algorithms
1
vote
0
answers
10
Depth First Search: Finding if The graph is connected
Better Explanation??
pradeepchaudhary
asked
in
DS
Dec 8, 2018
by
pradeepchaudhary
216
views
data-structures
depth-first-search
graph-algorithms
1
vote
0
answers
11
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
266
views
algorithms
breadth-first-search
depth-first-search
0
votes
1
answer
12
Graph Search
Which of the following statements are true? In a depth-first search of an undirected graph $G,$every edge of $G$ is either a tree edge or a back edge Forward and cross edges never occur in a depth-first search of an undirected graph A directed graph is acyclic if and only if a depth-first search yields no back edges $1$ $1$ and $2$ $2$ and $3$ All of these
Lakshman Patel RJIT
asked
in
Algorithms
Nov 13, 2018
by
Lakshman Patel RJIT
324
views
algorithms
graph-algorithms
depth-first-search
0
votes
0
answers
13
Depth First Search (DFS)
Consider the following sequence of nodes for the undirected graph given below$:$ $(1)PQSTWVUR$ $(2)PQRSTUWV$ $(3)PQRTUSVW$ A Depth First Search (DFS) is started at node $P.$The nodes are listed in the order they are first visited. Which all of the above are possible outputs$?$ $A)Only (2)$ $B)(1) and (2)$ $C)(2) and (3)$ $D)(1) and (2)$
Lakshman Patel RJIT
asked
in
Algorithms
Nov 13, 2018
by
Lakshman Patel RJIT
511
views
algorithms
graph-algorithms
depth-first-search
0
votes
0
answers
14
Depth First Search
Na462
asked
in
Programming
Nov 7, 2018
by
Na462
582
views
depth-first-search
data-structures
graph-algorithms
5
votes
1
answer
15
Graph
Also let me know the approach to find back edges, cross edges, forward edges, How to solve these questions
manvi_agarwal
asked
in
Algorithms
Sep 15, 2018
by
manvi_agarwal
1.8k
views
algorithms
graph-algorithms
depth-first-search
descriptive
test-series
0
votes
0
answers
16
DFS Tree
Consider the tree arcs of a DFS traversal from a source node W in an unweighted, connected, undirected, acyclic graph. The tree T formed by the tree arcs is a data structure for computing- 1. the shortest path between every pair of vertices. 2. the shortest path from W ... the graph. 3. the shortest paths from W to only those nodes that are leaves of T. 4. the longest path in the graph.
K ANKITH KUMAR
asked
in
Algorithms
Sep 1, 2018
by
K ANKITH KUMAR
381
views
depth-first-search
algorithms
graph-algorithms
0
votes
1
answer
17
DFS-Articulation Point and Bridges
I want to find the articulation point and bridges in the above graph. Further for each vertex $v$ I want to compute $v.low=$min $\left \{ v.d, w.d \right \}$ where $v.d$=discovery time of vertex v $w.d$=discovery time of ... someone help me with the values of v.low ? Because based on v.low I will be further able to solve articulation point and bridge problem.
Ayush Upadhyaya
asked
in
DS
Aug 28, 2018
by
Ayush Upadhyaya
328
views
graph-theory
depth-first-search
algorithms
0
votes
1
answer
18
Topological ordering and DFS
If we apply Topological and DFS traversal. Is there any intersection of ordering? Please explain.
Rishav Kumar Singh
asked
in
Algorithms
Aug 26, 2018
by
Rishav Kumar Singh
911
views
topological-sort
depth-first-search
3
votes
0
answers
19
Depth first search
The maximum number of edges possible with UDG of n nodes,when DFS call on any random node in the graph result in stack size of 5. i.e. 5 function calls present in stack simultaneously are ......... Ans. 10
Na462
asked
in
DS
Aug 21, 2018
by
Na462
840
views
depth-first-search
data-structures
graph-algorithms
1
vote
2
answers
20
How does below property hold for cross edge in a DFS Tree ?
If (u,v) is a cross edge then start[u] > start[v] end[u] > end[v]
radha gogia
asked
in
Algorithms
Aug 20, 2018
by
radha gogia
511
views
algorithms
depth-first-search
0
votes
1
answer
21
Test Datasructures
Statement I : If a directed graph G is cyclic but can be made acyclic by removing 1 edge then a DFS will encounter exactly 1 Backedge Statement II : A graph G has a cycle if DFS finds at least 1 Backedge Which of the following option is correct ? ... option is correct(Statement 1 is false and Statement 2 is true but answer given is 1, please tell me where i am making mistake.
Prince Sindhiya
asked
in
Algorithms
Aug 11, 2018
by
Prince Sindhiya
145
views
depth-first-search
graph-theory
data-structures
0
votes
0
answers
22
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
478
views
depth-first-search
breadth-first-search
algorithms
0
votes
0
answers
23
DFS algorithms
state TRUE or FALSE. and why Running a DFS on an undirected graph G = (V;E) always produces the same number of cross edges, no matter what order the vertex list V is in and no matter what order the adjacency lists for each vertex are in.
Rishav Kumar Singh
asked
in
Algorithms
Aug 2, 2018
by
Rishav Kumar Singh
631
views
depth-first-search
graph-algorithms
3
votes
1
answer
24
DFS Algo
Is following statement true/false? A DFS of a directed graph always produces the same number of tree edges, i.e., independent of the order in which vertices are considered for DFS. Answer is FALSE please explain
Rishav Kumar Singh
asked
in
Algorithms
Jul 30, 2018
by
Rishav Kumar Singh
1.4k
views
depth-first-search
algorithms
5
votes
1
answer
25
#Algorithms #DFS
Consider the tree arcs of a $DFS$ traversal from a source node $W$ in an unweighted, connected, undirected graph. The tree $T$ formed by the tree arcs is a data structure for computing the shortest path between every pair of vertices. the shortest path from $W$ ... in the graph. the shortest paths from $W$ to only those nodes that are leaves of $T$. the longest path in the graph.
iarnav
asked
in
Algorithms
May 28, 2018
by
iarnav
673
views
algorithms
graph-algorithms
depth-first-search
0
votes
0
answers
26
#Algorithms #DFS How to find if a directed graph G is strongly connected using DFS in one pass?
I know, Kosaraju algorithm and there's one other algorithm which involves reversing of G and using DFS, but two times, but there's some algorithm which uses DFS only time, but I can't be able find that algorithm. Someone please share that.
iarnav
asked
in
Algorithms
May 13, 2018
by
iarnav
282
views
graph-theory
algorithms
depth-first-search
graph-algorithms
Page:
1
2
3
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
Aptitude Overflow Book
Participate in Machine Learning benchmarking
GATE Overflow Tikz Templates
UPSC One Time Registration OTR Online Form 2022
DRDO CEPTAM 10 Online Form 2022
Subjects
All categories
General Aptitude
(2.4k)
Engineering Mathematics
(8.9k)
Digital Logic
(3.2k)
Programming and DS
(5.7k)
Algorithms
(4.5k)
Theory of Computation
(6.5k)
Compiler Design
(2.2k)
Operating System
(4.8k)
Databases
(4.4k)
CO and Architecture
(3.6k)
Computer Networks
(4.4k)
Non GATE
(1.2k)
Others
(2.5k)
Admissions
(644)
Exam Queries
(838)
Tier 1 Placement Questions
(17)
Job Queries
(72)
Projects
(9)
Unknown Category
(851)
Recent questions tagged depth-first-search
Recent Blog Comments
Sir some test due date passed 1-2 months ago pls...
@lalitver10 There is no restriction in doing...
@GateOverflow04 link fixed now.
@Arjun @Deepak Sir, In Test Schedule google...
sir is this for gate? it has way more questions...