ProsopoBook one of the biggest organizations of social networking, gives you a h

Question

ProsopoBook one of the biggest organizations of social networking, gives you a huge log from the messaging flow of it's customers in the following form:

From, To
Mario3412, BlueCat
Mario3412, OrangeFish
...

A message from "from" to "to", it's one undirected edge in it's customers message's graph G(V,E), where V contains all the customers who sent messages and E contains the total of (from,to) edges to the log. The company ProsopoBook,is interested in knowing if G is cohesive,that means if there is at least one path, in between all the vertices of V.

Because G is huge, you should write an effective algorithm(in pseudocode form), which will find the answer in ?(|V|+|E|) time.

Explanation / Answer

dear friend!
plz check the following links.

http://www-root.fnal.gov/root/class/exercises.htm

http://harambeenet.org/workshop/2006/assign/graphs.html

Related Questions

Navigate

• Browse (All)
• Browse P
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.