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
0
answers
1
Memory Based GATE DA 2024 | Question: 27
Consider performing Depth-First Search (DFS) on an undirected and unweighted graph $\bar{G}$ starting at vertex $S$. For any vertex $u$ in $G$, where $d[u]$ is the length of the shortest path from $S$ to $u$, let $(u \geqslant v)$ be an edge in ... $v$, then in the above DFS, the edge $(u, v)$ becomes: A forward edge A back edge A cross edge A tree edge
GO Classes
asked
in
Algorithms
Feb 5
by
GO Classes
143
views
gate2024-da-memory-based
goclasses
algorithms
graph-algorithm
depth-first-search
0
votes
0
answers
2
Memory Based GATE DA 2024 | Question: 34
BFS DFS question asking the number of nodes expanded BFS = DFS BFS $ DFS None
GO Classes
asked
in
Algorithms
Feb 5
by
GO Classes
106
views
gate2024-da-memory-based
goclasses
algorithms
graph-algorithm
depth-first-search
breadth-first-search
0
votes
0
answers
3
how can it have back edges?
pcla
asked
in
Algorithms
Jan 28
by
pcla
68
views
algorithms
graph-algorithms
depth-first-search
1
vote
2
answers
4
GATE Data Science and Artificial Intelligence 2024 | Sample Paper | Question: 1
Let $\text{b}$ be the branching factor of a search tree. If the optimal goal is reached after $\text{d}$ actions from the initial state, in the worst case, how many times will the initial state be expanded for iterative deepening depth-first ... $\text{IDDFS}$ $\text{-b}^{d}, \mathrm{IDA}^{*}\text{-b}^{d}$.
admin
asked
in
Others
Oct 22, 2023
by
admin
3.8k
views
gateda-sample-paper-2024
depth-first-search
0
votes
2
answers
5
mde esy test series
Which of the following statements is/are true? A. In a labelled undirected connected simple graph G, all the depth-first search from same node form same tree. B. In a labelled undirected connected simple graph, G, all the breadth first search from same node form same ... is descendent of u in all possible depth-first search forest of G. (u.d is discover time of node u in DFS).
Himanshu555
asked
in
Algorithms
Nov 8, 2022
by
Himanshu555
584
views
made-easy-test-series
graph-theory
depth-first-search
graph-algorithm
0
votes
1
answer
6
#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, 2022
by
Subbu.
321
views
algorithms
breadth-first-search
depth-first-search
3
votes
1
answer
7
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 Bhaiya
asked
in
DS
Mar 31, 2020
by
Lakshman Bhaiya
872
views
nielit2016dec-scientistb-it
data-structures
stack
depth-first-search
3
votes
2
answers
8
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 Bhaiya
asked
in
DS
Mar 31, 2020
by
Lakshman Bhaiya
3.0k
views
nielit2016dec-scientistb-it
data-structures
stack
depth-first-search
1
vote
2
answers
9
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 Bhaiya
asked
in
DS
Mar 30, 2020
by
Lakshman Bhaiya
1.4k
views
nielit2017july-scientistb-it
data-structures
graph-algorithm
breadth-first-search
depth-first-search
0
votes
1
answer
10
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 Bhaiya
asked
in
Graph Theory
Mar 30, 2020
by
Lakshman Bhaiya
871
views
nielit2017july-scientistb-it
discrete-mathematics
graph-theory
depth-first-search
1
vote
1
answer
11
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.8k
views
ugcnetcse-june2019-paper2
depth-first-search
1
vote
0
answers
12
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.4k
views
depth-first-search
breadth-first-search
algorithms
graph-algorithm
1
vote
1
answer
13
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
13.3k
views
graph-theory
depth-first-search
geeksforgeeks-test-series
graph-algorithm
0
votes
1
answer
14
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
425
views
depth-first-search
algorithms
graph-algorithm
1
vote
0
answers
15
Depth First Search: Finding if The graph is connected
Better Explanation??
pradeepchaudhary
asked
in
DS
Dec 8, 2018
by
pradeepchaudhary
302
views
data-structures
depth-first-search
graph-algorithm
1
vote
0
answers
16
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
435
views
algorithms
breadth-first-search
depth-first-search
0
votes
1
answer
17
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 Bhaiya
asked
in
Algorithms
Nov 13, 2018
by
Lakshman Bhaiya
540
views
algorithms
graph-algorithm
depth-first-search
0
votes
0
answers
18
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 Bhaiya
asked
in
Algorithms
Nov 13, 2018
by
Lakshman Bhaiya
802
views
algorithms
graph-algorithm
depth-first-search
0
votes
0
answers
19
Depth First Search
Na462
asked
in
Programming in C
Nov 7, 2018
by
Na462
928
views
depth-first-search
data-structures
graph-algorithm
5
votes
1
answer
20
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
2.4k
views
algorithms
graph-algorithm
depth-first-search
descriptive
test-series
0
votes
0
answers
21
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
663
views
depth-first-search
algorithms
graph-algorithm
0
votes
1
answer
22
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
427
views
graph-theory
depth-first-search
algorithms
0
votes
1
answer
23
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
1.3k
views
topological-sort
depth-first-search
3
votes
0
answers
24
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
1.2k
views
depth-first-search
data-structures
graph-algorithm
Page:
1
2
3
4
next »
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
Recent Posts
Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes
Subjects
All categories
General Aptitude
(3.5k)
Engineering Mathematics
(10.4k)
Digital Logic
(3.6k)
Programming and DS
(6.2k)
Algorithms
(4.8k)
Theory of Computation
(6.9k)
Compiler Design
(2.5k)
Operating System
(5.2k)
Databases
(4.8k)
CO and Architecture
(4.0k)
Computer Networks
(4.9k)
Artificial Intelligence
(79)
Machine Learning
(48)
Data Mining and Warehousing
(24)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(682)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
243k
comments
79.6k
users
Recent questions tagged depth-first-search
Recent Blog Comments
Hlo I'm Rupesh I got AIR 3485 in gate CS and AIR...
@Ajay Sasank here is the direct link...
Thank you for the post didi My GATE 2023 & 2024...
I Hope it helps 😊
Today's best post I seen thank you for motivation