GATE CSE
First time here? Checkout the FAQ!
x
+1 vote
75 views
How to find number of BFS and DFS traversals for any complete graph? I am trying to find a formula for it.
asked in Algorithms by (43 points)   | 75 views
No formula is there for BFS, DFS I think

1 Answer

+1 vote

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)

 

answered by Loyal (4.6k points)  
Correct me if I am wrong.

Related questions

0 votes
2 answers
1
+1 vote
1 answer
2
asked in Algorithms by vaishali jhalani Boss (6.1k points)   | 137 views


Top Users Jul 2017
  1. Bikram

    5368 Points

  2. manu00x

    3092 Points

  3. Arjun

    1924 Points

  4. joshi_nitish

    1894 Points

  5. Debashish Deka

    1874 Points

  6. Tesla!

    1380 Points

  7. pawan kumarln

    1336 Points

  8. Hemant Parihar

    1314 Points

  9. Shubhanshu

    1136 Points

  10. Arnab Bhadra

    1124 Points


24,137 questions
31,140 answers
70,874 comments
29,458 users