algorithm : 1) Initialize all vertices as not visited. 2) Do following for every vertex 'v'. (a) If 'v' is not visited before, call DFSUtil(v) (b) Print new line character DFSUtil(v) 1) Mark 'v' as visited. 2) Print 'v' 3) Do following for every adjacent 'u' of 'v'. If 'u' is not visited, then recursively call DFSUtil(u)
algorithm :
1) Initialize all vertices as not visited.
2) Do following for every vertex 'v'.
(a) If 'v' is not visited before, call DFSUtil(v)
(b) Print new line character
DFSUtil(v)
1) Mark 'v' as visited.
2) Print 'v'
3) Do following for every adjacent 'u' of 'v'.
If 'u' is not visited, then recursively call DFSUtil(u)
I think the "unidirected graph" should be "undirected graph" - 0:33
i was 10th class when this video was released😂😂😂😂now am btech 3rd yr
Yes bro tommorow sem
Such a ridiculous video!! She just writes some basic definitions on a piece of paper without explaining anything.
not enough !!!!
Didn't understand the algorithm
thanks
is it undirected or unidirected?
connected component or simply component of an undirected graph is a subgraph in which each pair of nodes is connected with each other via a path.
Quantum se padha rahi hain mam😍
Better delete this video no use of it
Just explain it with some examples ,this is not useful
Mam kus b smj ni aya.., not explained properly
Slow your speed ideat
Sorry I can't idiot because exam in an hour