The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
GATE Overflow
Facebook Login
Google Login
or
Email or Username
Password
Remember
Login
Register

I forgot my password
All Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous
Blogs
New Blog
Exams
First time here? Checkout the
FAQ
!
x
×
Close
Use the google search bar on side panel. It searches through all previous GATE/other questions. For hardcopy of previous year questions please see
here
Recent questions tagged dfs
+1
vote
1
answer
1
#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.
asked
May 28
in
Algorithms
by
iarnav
Loyal
(
7.5k
points)

53
views
algorithms
graphalgorithms
graphtheory
dfs
0
votes
0
answers
2
#Algorithms #DFS How to find if a directed graph G is strongly connected using DFS in one pass?
asked
May 13
in
Algorithms
by
iarnav
Loyal
(
7.5k
points)

40
views
graphtheory
algorithms
dfs
graphalgorithms
0
votes
1
answer
3
DFS Traversal
If DFS algorithm applied starting from vertex A' which uses stack data structure then the height of stack is needed in worst case for DFS traversal is ________? Soln. Its a simple piece of cake we just need to find that path which leads to maximum nodes ... 0 and when to start counting with 1 because such type of ambiguous question always let my question go wrong and its painful :(
asked
May 6
in
Algorithms
by
Na462
Active
(
4.1k
points)

60
views
dfs
algorithms
graphalgorithms
0
votes
0
answers
4
DFS Modification
How DFS(Depth First Search) modification is used to find whether a graph is planar or not ?
asked
Mar 21
in
Algorithms
by
ankitgupta.1729
Loyal
(
6.4k
points)

110
views
dfs
algorithms
graphalgorithms
shaisimonson
0
votes
0
answers
5
DFSAlgorithm
Let T be a depth first search tree in an undirected graph G. Vertices u and ν are leaves of this tree T. The degrees of both u and ν in G are at least 2. In such case in the graph there will be two cycles : One Cycle will contain u and other one v. There cannot be a graph containig a single cycle and containing both u and v and also satisfy above Constraint. Am I right?
asked
Feb 18
in
Algorithms
by
Na462
Active
(
4.1k
points)

125
views
dfs
algorithms
graphalgorithms
+2
votes
1
answer
6
Back edge,tree edge,forward edges in BFS
asked
Jan 27
in
DS
by
MIRIYALA JEEVAN KUMA
Active
(
1.8k
points)

328
views
algorithms
bfs
dfs
graphalgorithms
programminginc
datastructure
+1
vote
0
answers
7
DFS depth first search
asked
Jan 25
in
DS
by
budhu
(
139
points)

59
views
datastructure
dfs
graphalgorithms
graphconnectivity
+2
votes
0
answers
8
DFS Depth First Search
If we backtrack in DFS ,then doesn't statement 1 becomes true ?
asked
Jan 13
in
Graph Theory
by
Pawan Kumar 2
Active
(
4.5k
points)

65
views
dfs
+2
votes
0
answers
9
made easy test series
For a directed graph, the absence of back edges in a DFS tree can have cycle. true or fale.please explain with an example.
asked
Jan 10
in
Algorithms
by
jaig
(
191
points)

48
views
madeeasytestseries
algorithms
dfs
+2
votes
1
answer
10
Ace testseries
How TO SOLVE?
asked
Jan 10
in
Algorithms
by
Deepak Mokili
(
307
points)

40
views
algorithms
dfs
+1
vote
0
answers
11
Test Series
Choose the correct option, from the following: I) We can find the cycle in the graph using BFS. II) We can find the cycle in the graph using DFS. III)Both Correct IV)Both wrong
asked
Jan 10
in
Programming
by
ankit_thawal
Active
(
2.1k
points)

34
views
dfs
cycle
0
votes
0
answers
12
made easy test series
asked
Jan 4
in
Algorithms
by
rohit vishkarma
Junior
(
915
points)

69
views
graph
dfs
+1
vote
1
answer
13
ace test series
asked
Dec 27, 2017
in
Algorithms
by
rohit vishkarma
Junior
(
915
points)

54
views
dfs
0
votes
0
answers
14
DFS Depth First Search
Shouldn't ans be none ? If no where did I go wrong? kindly help
asked
Dec 25, 2017
in
Algorithms
by
Pawan Kumar 2
Active
(
4.5k
points)

60
views
dfs
0
votes
0
answers
15
DFS times
asked
Dec 12, 2017
in
Programming
by
Shivam Chauhan
Loyal
(
8.8k
points)

81
views
dfs
algorithms
0
votes
1
answer
16
#Graphs #DS BFS AND DFS Question?
Can BFS and DFS both work cyclic and acyclic graphs?! Kindly explain for each of 'em. Thank you!
asked
Dec 9, 2017
in
Algorithms
by
iarnav
Loyal
(
7.5k
points)

252
views
algorithms
bfs
dfs
graphalgorithms
datastructure
+1
vote
1
answer
17
DFS Depth First Search
asked
Dec 3, 2017
in
Algorithms
by
Shubham Kumar Gupta
Junior
(
547
points)

84
views
dfs
algorithms
graphalgorithms
datastructure
0
votes
2
answers
18
DFS , how to slove it?
asked
Nov 18, 2017
in
DS
by
Parshu gate
Active
(
4.9k
points)

164
views
dfs
algorithms
graphalgorithms
datastructure
0
votes
0
answers
19
techtud
Let G is a graph with n vertices and m edges. Consider following statements : i. In DFS traversal, number of tree edges produced is independent of selection of starting vertex. ii. In BFS traversal, number of tree edges produced is independent of selection of starting vertex. iii. ... B) Only statements (ii) and (iii) are correct (C) Statements (ii) and (iv) both are wrong (D) None of these
asked
Nov 7, 2017
in
Computer Networks
by
Manoja Rajalakshmi A
Active
(
3k
points)

112
views
computernetworks
dfs
bfs
+1
vote
1
answer
20
Depth first search
Consider the following graph G. Modified DFS on G applied as follows: • Starting vertex is ‘p’. • Vertex is visited based on alphabetic order. • Vertices are visited in order p, q, r, s, t, v. • It works same as DFS except the visiting order restriction What is the number of back edges during the above DFS traversal on G ______________
asked
Nov 7, 2017
in
Algorithms
by
shivangi5
Active
(
1.4k
points)

159
views
dfs
0
votes
0
answers
21
Single source softest path via DFS
Hi Guys, BFS could be used for finding single source shortest path in unweighted graph. But could we use DFS also ? Please share your valuable opinion. PS: I think after little bit modification DFS could also be used but it's running time will increase.
asked
Nov 4, 2017
in
Algorithms
by
Chhotu
Boss
(
10.6k
points)

39
views
graphalgorithms
algorithms
dfs
+1
vote
1
answer
22
Strongly connected graph verification via BFS
asked
Nov 4, 2017
in
Algorithms
by
Chhotu
Boss
(
10.6k
points)

139
views
graphtheory
bfs
algorithms
dfs
0
votes
1
answer
23
Depth First Search
Please someone explain .... A directed graph G is acyclic iff depth first search of G yields no back edges
asked
Nov 1, 2017
in
Programming
by
Shivi rao
Junior
(
785
points)

96
views
dfs
0
votes
1
answer
24
DFS: Practice Exercise
Q1. Consider the following DFS algorithm for cycle detection in a graph. DFS(G) for each vertex u Belongs G.V u.color = WHITE U.pi = NIL time = 0 for each vertex u Belongs G.V if u.color == WHITE DFSVISIT(G , u) DFSVISIT(G, u) time = ... DFS tree if we draw an edge from one leaf node to another leaf node then that edge is called cross edge. Is this statement is true ??
asked
Oct 28, 2017
in
Algorithms
by
Shubhanshu
Boss
(
15.1k
points)

70
views
algorithms
graphalgorithms
dfs
+2
votes
0
answers
25
DFS: certain nodes not pushed to the stack.
asked
Oct 20, 2017
in
Algorithms
by
Shubhanshu
Boss
(
15.1k
points)

140
views
algorithms
dfs
graphalgorithms
datastructure
+1
vote
0
answers
26
DFS: number of nodes not pushed into the stack.
asked
Oct 19, 2017
in
Programming
by
Shubhanshu
Boss
(
15.1k
points)

424
views
algorithms
graphalgorithms
dfs
datastructure
+1
vote
1
answer
27
Algo: BFS
If in a given graph all edge weights are equal and negative then BFS will correctly find out single source shortest path to all vertices,starting from vertex v? True/False?
asked
Oct 4, 2017
in
Algorithms
by
rahul sharma 5
Boss
(
24.3k
points)

93
views
bfs
algorithms
dfs
+2
votes
2
answers
28
Graph_Traversal
asked
Aug 30, 2017
in
DS
by
Gate Ranker18
Active
(
2.3k
points)

104
views
graphalgorithms
dfs
bfs
0
votes
1
answer
29
DFS back edge
If a directed graph G is cyclic but can be made acyclic by removing 1 edge then a DFS will encounter exactly 1 Backedge. True or false ?
asked
Aug 20, 2017
in
Programming
by
Xylene
Active
(
3.8k
points)

209
views
dfs
algorithms
graphalgorithms
0
votes
1
answer
30
Vertex degrees
Let G be a simple undirected graph such that G contains only vertex 'u' of maximum degree and let D be a DFS tree of G such that D contains only vertex 'v' of maximum degree. Which of the following is True? [ A ] 'u' is same as 'v' always [ B ... multiple self loops, hence having a degree of 2n. But the dfs tree should have just one vertex with a single self loop in this case, right?
asked
Feb 3, 2017
in
Algorithms
by
Krunal2016
(
195
points)

67
views
dfs
Page:
1
2
next »
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
AAI Junior Exceutive(Information Technology)
The 2018 APL Problem Solving Contest
GO Classroom for GATE 2019
Mtech CSE  IITH (TA) Interview Experience
MS Programme @ IIT
Follow @csegate
Gatecse
Recent questions tagged dfs
Recent Blog Comments
What about my order sir, when will it be shipped??
Will be sent by tomorrow.
@Arjun sir, please send the book to this ...
Oh. You weren't contacted? Anyway I'll send again ...
@Arjun Sir, My GO Book is returned back ...
37,164
questions
44,736
answers
127,408
comments
43,806
users