closed by
1,421 views
1 votes
1 votes
closed
Can someone please explain what are the types of edges possible in BFS and DFS for DIRECTED as well as UNDIRECTED graphs?

Individual meaning of BACK, FRONT and CROSS edges is clear, but can’t decide which are present and which are not for Traversals.

an example would be of great help or any specific reference on this.
closed by

Related questions

0 votes
0 votes
0 answers
2
Rishav Kumar Singh asked Aug 2, 2018
796 views
Please give an example i didn't get itThe depth of any DFS tree rooted at a vertex is at least as much as thedepth of any BFS tree rooted at the same vertex.
0 votes
0 votes
1 answer
3
0 votes
0 votes
1 answer
4
Subbu. asked Jul 16, 2022
348 views
Please list the problems where BFS alone can do and DFS alone can do and both can do??