retagged by
250 views
0 votes
0 votes

Are the "n!"  ways maximum possible BFS sequences ? ( Indirectly, for any given vertices is it obvious that complete graph will give max BFS sequences ? )

retagged by

1 Answer

0 votes
0 votes
According to me we have 5 choices to select which vertex to start from and for each choice we have 4! ways to select other four vertices for example if A is selected the we can have BCED,BDEC,......upto 4!

so total number of BFS possible for complete graph for 5 vertices would be 5x4!=5!

please correct me if this approach is wrong
Answer:

Related questions

0 votes
0 votes
1 answer
1
VS asked Nov 26, 2017
931 views
1 votes
1 votes
0 answers
3
admin asked Dec 15, 2022
327 views
Consider the following graph.How many nodes (apart from $s$) does the Breadth First Search algorithm discover before discovering $t$ when starting from $s$.
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?