The Gateway to Computer Science Excellence
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.
in Algorithms by Junior (667 points)
closed by | 188 views

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.

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,645 questions
56,596 answers
102,075 users