577 views
0 votes
0 votes
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 formula for it??

1 Answer

0 votes
0 votes
As such there is not any formula to find number of valid sequences in a graph since validation of sequence depends on structure or type of the graph

Related questions

0 votes
0 votes
1 answer
2
iarnav asked Dec 9, 2017
705 views
Can BFS and DFS both work cyclic and acyclic graphs?! Kindly explain for each of 'em. Thank you!
1 votes
1 votes
1 answer
3
vaishali jhalani asked Dec 16, 2016
1,419 views
2 votes
2 votes
3 answers
4
rahul sharma 5 asked Dec 15, 2016
695 views
What are some applications where only DFS can be used and BFS can t and vice versa?