GATE CSE
First time here? Checkout the FAQ!
x
+1 vote
109 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)   | 109 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 Boss (5.3k points)  
Correct me if I am wrong.

Related questions

+2 votes
2 answers
1
asked in DS by Gate Ranker18 Active (1.2k points)   | 60 views
0 votes
2 answers
2


Top Users Sep 2017
  1. Habibkhan

    7838 Points

  2. Warrior

    2812 Points

  3. Arjun

    2696 Points

  4. rishu_darkshadow

    2692 Points

  5. A_i_$_h

    2456 Points

  6. manu00x

    2040 Points

  7. nikunj

    1980 Points

  8. Bikram

    1864 Points

  9. makhdoom ghaya

    1790 Points

  10. SiddharthMahapatra

    1718 Points


26,243 questions
33,815 answers
80,261 comments
31,168 users