Algorithm D&A
Instructor: NohJin Park
Program Assignment 2
Due: Midnight Nov. 30, 2010
In this assignment, you will experiment with graphs, and graph algorithm. A
social network
can
be represented as a graph whose vertices represent people and whose edges represent
relationships between people. You will implement a program that reads in and analyzes a social
network, where the relationship is defined as “knowing” one another. If two people know one
another, there will be an undirected edge connecting their corresponding vertices in the graph
representation of the
social network
. Your program will analyze the minimum, maximum and
average degree of vertices in the network, the average shortest path length between every pair of
persons, the longest shortest path length between two people, and the largest
clique
in the graph
(a set of people who all know each other). Specifically:
1.
Your program will take a file name as an argument. The first two lines of the file
will contain the number of persons
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 '10
 NohJinPark
 Algorithms, Graph Theory, shortest path length

Click to edit the document details