retagged by
2,676 views
0 votes
0 votes

retagged by

1 Answer

0 votes
0 votes

here is a result given in cormen book.....
A directed graph G is acyclic iff depth first search of G yields no back edges
i think b is correct
 

Related questions

0 votes
0 votes
1 answer
1
Xylene asked Aug 20, 2017
2,440 views
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 ?
0 votes
0 votes
0 answers
2
1 votes
1 votes
1 answer
3
rahul sharma 5 asked Dec 15, 2016
2,275 views
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 vert...
1 votes
1 votes
1 answer
4
thor asked Jan 15, 2017
301 views