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
how can it have back edges?
pcla
asked
in
Algorithms
Jan 27
82
views
0
votes
0
votes
algorithms
graph-algorithms
depth-first-search
pcla
asked
in
Algorithms
Jan 27
by
pcla
82
views
answer
comment
Follow
share this
share
1 comment
by
L.E.O
commented
Jan 28
reply
Follow
share this
It is a directed graph...so the BFS can have back edges
0
0
Please
log in
or
register
to add a comment.
Please
log in
or
register
to answer this question.
0
Answers
← Previous
Next →
← Previous in category
Next in category →
Related questions
0
votes
0
votes
1
answer
1
Xylene
asked
in
Programming in C
Aug 20, 2017
2,464
views
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 ?
Xylene
asked
in
Programming in C
Aug 20, 2017
by
Xylene
2.5k
views
depth-first-search
algorithms
graph-algorithms
1
vote
1
vote
0
answers
2
Shamim Ahmed
asked
in
Algorithms
Nov 26, 2018
457
views
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
457
views
algorithms
breadth-first-search
depth-first-search
6
votes
6
votes
1
answer
3
MIRIYALA JEEVAN KUMA
asked
in
DS
Jan 27, 2018
13,263
views
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
13.3k
views
algorithms
breadth-first-search
depth-first-search
graph-algorithm
programming-in-c
data-structures
1
vote
1
vote
1
answer
4
rahul sharma 5
asked
in
Algorithms
Dec 15, 2016
2,287
views
[Algorithms] BFS Back edges
True / False? 1. For a directed graph, the absence of back edges with respect to a BFS tree implies that the graph is acyclic. 2. 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.
rahul sharma 5
asked
in
Algorithms
Dec 15, 2016
by
rahul sharma 5
2.3k
views
algorithms
graph-algorithms
true-false
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
(25)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(684)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
244k
comments
80.0k
users
Recent Blog Comments
category ?
Hi @Arjun sir, I have obtained a score of 591 in ...
download here
Can you please tell about IIT-H mtech CSE self...
Please add your admission queries here:...
Twitter
WhatsApp
Facebook
Reddit
LinkedIn
Email
Link Copied!
Copy
