menu
Recent questions tagged dfs
Login
Register
My account
Edit my Profile
Private messages
My favorites
Register
Recent questions tagged dfs
All Activity
Q&A
Questions
Unanswered
Tags
Categories
Users
Ask a Question
Blogs
Previous Year
Exams
Recent questions tagged dfs
0
votes
0
answers
16
views
#testsseries
Consider the following graph: Which of the following statements are false? A.There is no cycle in the above graph. B.There are exactly 3 back edges for a given DFS tree in the graph. C.There is atleast one strongly connected component present in the graph. D.The graph has a topological sort.
Abhishek tarpara
asked
in
DS
Aug 18, 2021
by
Abhishek tarpara
13
points
16
views
data-structures
dfs
trees
graph-connectivity
0
votes
0
answers
28
views
Made easy test series #algorithm #graph #DFS
Did not understand answer of this question plz help me to resolve problem.
taatya bichhu
asked
in
Algorithms
Jun 26, 2021
by
taatya bichhu
5
points
28
views
made-easy-test-series
algorithms
graph-algorithms
dfs
0
votes
0
answers
47
views
Single Source Shortest Paths
Can the DFS algorithm be used to solve the single source shortest paths problem?
thisusernametaken
asked
in
Algorithms
Dec 7, 2020
by
thisusernametaken
5
points
47
views
dfs
1
vote
1
answer
184
views
Self Doubt - Classification of Edges in DFS
Source: Cormen. Back edges are those edges (u,v) connecting a vertex u to an ancestor v in a depth-first tree. We consider self-loops, which may occur in directed graphs, to be back edges. Forward edges are those non-tree edges (u, ... doubt: Why there is a difference in the definition of the highlighted part? Back edges are also non-tree edges, isn't it?
KUSHAGRA गुप्ता
asked
in
DS
Sep 8, 2020
by
KUSHAGRA गुप्ता
1.4k
points
184
views
algorithms
graph-algorithms
dfs
0
votes
1
answer
34
views
Self doubt in Graph Based Algorithms (Made easy theory book)
sarthakdarji
asked
in
Algorithms
Sep 1, 2020
by
sarthakdarji
11
points
34
views
algorithms
dfs
0
votes
0
answers
28
views
gradeup mocks for NIELIT . i have doubt in 3rd and 4th option.
rohankr95
asked
in
Programming
May 1, 2020
by
rohankr95
5
points
28
views
dfs
ds
0
votes
0
answers
12
views
GATE1989-4-vii Video Solution
Provide short answers to the following questions: In the graph shown above, the depth-first spanning tree edges are marked with a 'T'. Identify the forward, backward and cross edges.
admin
asked
in
Graph Theory
Apr 18, 2020
by
admin
585
points
12
views
gate1989
descriptive
graph-theory
spanning-tree
dfs
video-solution
0
votes
0
answers
197
views
Cormen Edition 3 Exercise 22.4 Question 3 (Page No. 615)
KUSHAGRA गुप्ता
asked
in
Algorithms
Nov 13, 2019
by
KUSHAGRA गुप्ता
1.4k
points
197
views
cormen
graph-algorithms
descriptive
dfs
To see more, click for the
full list of questions
or
popular tags
.
Ask a Question
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
Welcome to GATE CSE Doubts, where you can ask questions and receive answers from other members of the community.
Recent Posts
New GATEOverflow PDFs
Guidelines to users
No Recent Blog Comments
Search GATE CSE Doubts