894 views

1 Answer

1 votes
1 votes

I am posting answer myself.Please correct if wrong.I am also sharing some points i read about these edges.

  • Back edges point from a node to one of its ancestors in the DFS tree.

  • Forward edges point from a node to one of its descendants.

  • Cross edges point from a node to a previously visited node that is neither an ancestor nor a descendant.

So for above question

We can see if BFS graph of the tree in above image,all the edges drawn with RED are Cross edges because there is no parent child relation between these edges.These are edges which are dropped while BFS traversal.But d-b is a tree edge and not cross edge.

More information:-

https://courses.csail.mit.edu/6.006/fall11/rec/rec14.pdf

Related questions

1 votes
1 votes
0 answers
3
Shamim Ahmed asked Nov 26, 2018
456 views
Does Back Edges in both BFS and DFS leads to cycle in a directed graph? Please elaborate.
0 votes
0 votes
1 answer
4
Subbu. asked Jul 16, 2022
344 views
Please list the problems where BFS alone can do and DFS alone can do and both can do??