Register

Algorithms, Graph theory

• retagged by
1,568 views

1 Answer

2 votes
2 votes

Say no of vertices in the graph = N

As per my observation. no of BFS traversal in a complete graph is no of vertices in the graph = factorial( N).

no of DFS traversal in a complete graph is no of vertices in the graph = factorial( N)

User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
1 answer
1
Nandkishor3939 asked Jan 5, 2019
1,461 views
MadeEasy Test Series 2019: Algorithms - Graph Algorithms
Which is the best data structure to implement topological sort on directed graph? Heap Stack queue Array
Which is the best data structure to implement topological sort on directed graph?HeapStackqueueArray
User Avatar
0 votes
0 votes
0 answers
3
Prince Sindhiya asked Jan 2, 2019
857 views
Zeal Test Series 2019: Algorithms - Graph Algorithms
If the DFS finishing time f[u] < f[v] for two vertices u and v in a directed graph G, and u and v are in the same DFS tree in the DFS forest, then u is an ancestor of v in the depth first tree ? True /False can anyone explain it ?
If the DFS finishing time f[u] < f[v] for two vertices u and v in a directed graph G, and u and v are in the same DFS tree in the DFS forest, then u is an ancestor of v i...
User Avatar
0 votes
0 votes
0 answers
4
CHïntän ÞäTël asked Dec 25, 2018
367 views
MadeEasy Test Series: Algorithms - Graph Algorithms
According To Me Answer Should Be 6… Anyone Please Try Once!!! Given Is 5 With No Explaination !!!! like 11-12-12 then for second square 4 times 13 so c(4,2) any two of then lead to me @ answer @6.
According To Me Answer Should Be 6… Anyone Please Try Once!!! Given Is 5 With No Explaination !!!!like 11-12-12 then for second square 4 times 13 so c(4,2) any two of t...
User Avatar
Link Copied!