in Programming
111 views
0 votes
0 votes
Statement: DFS of an undirected graph contains tree edges and back edges but can never contain forward edges and cross ege. TRUE

if it is a undirected graph then there is no difference between forward and backward edges hence above statement should be false, but it is given true. please clear my doubts
in Programming
111 views

Please log in or register to answer this question.