Connected Components | Graph | Design & Algorithms | Lec-34 | Bhanu Priya

connected components in Graph explained

[sumeshkumar]

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)

[shaileshkadhikari]

I think the "unidirected graph" should be "undirected graph" - 0:33

[MrDkify]

Such a ridiculous video!! She just writes some basic definitions on a piece of paper without explaining anything.

[sumeshkumar]

not enough !!!!
Didn't understand the algorithm

[mohamed_v]

thanks <3 .. just i wanna to ask u .. if u have that algorithm already compiled in c or other lunguage ??

[cristinjhon]

Just explain it with some examples, this is not useful

[eneshkaneshk]

Mam kus b smj ni aya.., not explained properly