retagged by
677 views

3 Answers

0 votes
0 votes
1. DFS is used to get one of the precedence Orders in a DAG.
2. DFS is used in the implementation of Back Tracking design Strategy.

Both if the cases, BFS can not be used.
0 votes
0 votes

BFS applications :

we can find graph is bipartite or not.

finding single source shortest path in case of all edges weights are 1.

 

DFS application :

finding articulation points in given graph

 

Related questions

1 votes
1 votes
1 answer
1
vaishali jhalani asked Dec 16, 2016
1,372 views
1 votes
1 votes
1 answer
2
komal07 asked May 14, 2015
1,440 views
0 votes
0 votes
1 answer
3
Saurav asked Aug 27, 2015
1,398 views
The predessor subgraph of BFS is a tree but the predecessor subgraph of DFS is a forest ?? please explain why??
0 votes
0 votes
1 answer
4
Hira Thakur asked Aug 22, 2017
553 views
suppose there are N number of nodes. How many ways we can write DFS and BFS sequence for it.how many are the valid sequence???how many are invalid??can we generalized the...