Please solve it in efficient manner?
 

You have N computers and [Ca, Cb] means a is connected to b and this connectivity is symmetric and transitive. then write a program which checks that all computers are interconnected and talk two each other

Re: Please solve it in efficient manner?
 

If its a puzzle or some kind of competition let it know and I would move it to the right forum

Re: Please solve it in efficient manner?
 

That is algorithm design(Data Structure(Graph theory)only). It's not a puzzle. But in algo design it can come to puzzles as well as Data structure(C) section. But This is not for comptetion, it's tinny probs.