In case of** Directed graph**, it can yield 4 types of edges; tree, forward, back and cross edges.

But in case of * undirected graph *forward and back edges are same only. And cross edges aren't possible in this case.

0 votes

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.

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