3,279 views
0 votes
0 votes

In BFS of a directed graph, we don't have forward edges.Only tree edge,cross edge or back edge.

Below is a sample graph I have taken and classified edge types.

Please verify guys whether it's correct.

The algorithm I have used is the pseudocode given by "redtuna" in the selected answer here.

https://stackoverflow.com/questions/29631211/edge-classification-during-breadth-first-search-on-a-directed-graph

Please log in or register to answer this question.

Related questions

0 votes
0 votes
1 answer
2
codingo1234 asked Nov 21, 2018
367 views
HOW CAN WE GET A CROSS EDGE WHILE PERFORMING A BFS ON UNDIRECTED AND DIRECTED GRAPH CAN ANYONE SHOW WITH AN EXAMPLE?
2 votes
2 votes
0 answers
3
gari asked Jan 11, 2018
617 views
what is the question asking exactly?
1 votes
1 votes
2 answers
4
saptarshiDey asked Feb 1, 2019
819 views
What will be the path from A-H if BFS is used in the following graph?