CprE 310: Theoretical Foundations of Computer Engineering
Due March 11, 2008
Friendly World or Not?
1
Goal
The goal of this assignment is to provide an understanding of how large graphs are represented in
a computer, and experience in designing and applying graph algorithms.
2
Description
Recently, social networks like Facebook and MySpace have become immensely popular among
those who wish to have their own presence on the internet and share their life with others online.
This assignment focuses on the
friendly world problem
, where the goal is to figure out if the
world (as defined by the social network) is connected or not. A social network is defined to be
connected if starting from any person in the network, it is possible to get to any other person in
the network through a sequence of friends. In other words, consider an undirected graph whose
vertices are all people in the network, and where there is an edge between two vertices if the
corresponding people are friends. The problem is to determine if this graph is connected or not.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
This is the end of the preview.
Sign up
to
access the rest of the document.
 Spring '08
 Srikanta
 Graph Theory, Network theory, Brad Pitt

Click to edit the document details