retagged by
539 views

2 Answers

0 votes
0 votes
Yes,
Theorem:-> A directed graph has a cycle iff DFS reveals a back edge.

Means if there is cycle then there is compulsory back edge in DFS of G and vice versa.

So here as per ur question by removing 1 edge it becomes acyclic so, then definitely we encounter a Back edge when we do DFS of G.

U may take any no. of examples and cross verify it.
0 votes
0 votes

I hope it is clear now.

Related questions

0 votes
0 votes
0 answers
1
0 votes
0 votes
0 answers
4
saumya mishra asked Sep 25, 2017
279 views
What is the correct answer please provide with reason?