The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
+1 vote
130 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 (71 points) | 130 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 (6.1k points)
Correct me if I am wrong.

Related questions

+2 votes
2 answers
1
asked in DS by Gate Ranker18 Active (1.6k points) | 72 views
0 votes
0 answers
2
0 votes
2 answers
3


Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true

28,982 questions
36,818 answers
91,197 comments
34,706 users