Register

ME OTS

• retagged by
607 views
0 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 ? )

1 Answer

0 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
Voting & Accepting an answer helps improve the community
Answer:
← Previous · ME OTSNext → · Hashing + Counting ,...
← Previous in category · ME OTSNext in category → · Hashing + Counting ,...
Position:
Show:

Related questions

0 0 votes
1 1 answer
2.2k
2.2k views
VS asked Nov 26, 2017
2,173 views
Breadth first Search
Consider the following graph G.The BFS traversal on G is modified as : The starting vertex for traversal will be 'a'. At any level (breadth), vertices are visited in alph...
0 0 votes
0 0 answers
645
645 views
HeadShot asked Dec 1, 2018
645 views
ME - OTS 3
5 5 votes
2 2 answers
795
795 views
gatecse asked Feb 23
795 views
GATE DA 2026 | Question: 30
Consider a directed graph $G=(V, E)$, where $V$ is the finite set of vertices and $E$ is the set of directed edges between the vertices. $G$ may contain cycles but there ...
0 0 votes
1 1 answer
385
385 views
Shubham Sharma 2 asked Sep 10, 2025
385 views
UGC NET CSE | January 2025 | Part 2 | Question: 61
Which of the following algorithms are based on the Breadth First Search (BFS) ?Prim's algorithmsKruskal algorithmsDijkstra algorithmsGreedy algorithmsDynamic ProgrammingC...