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

[@MrDkify]

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

[@sakethsunny7092]

i was 10th class when this video was released😂😂😂😂now am btech 3rd yr

[@Crictalks00]

Yes bro tommorow sem

[@shaileshkadhikari]

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

[@sumeshkumar9940]

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)

[@sumeshkumar9940]

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

[@htalkies]

is it undirected or unidirected?

[@hnmillioner7177]

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.

[@cristinjhon8444]

Just explain it with some examples ,this is not useful

[@mohamed_v1]

thanks

[@divyaharshini2101]

Better delete this video no use of it

[@eneshkaneshk380]

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

[@abhinaypandey3975]

Quantum se padha rahi hain mam😍

[@Dheerajkumar-yz2mk]

Slow your speed ideat

[@HarithaCheekati]

Sorry I can't idiot because exam in an hour