<![CDATA[
CSE143 Sample Program handout #10
Input file friends.dot
--------------------------------------
graph {
Ashley -- Christopher
Ashley -- Emily
Ashley -- Joshua
Bart -- Lisa
Bart -- Matthew
Christopher -- Andrew
Emily -- Joshua
Jacob -- Christopher
Jessica -- Ashley
JorEl -- Zod
KalEl -- JorEl
Kyle -- Lex
Kyle -- Zod
Lisa -- Marge
Matthew -- Lisa
Michael -- Christopher
Michael -- Joshua
Michael -- Jessica
Samantha -- Matthew
Samantha -- Tyler
Sarah -- Andrew
Sarah -- Christopher
Sarah -- Emily
Tyler -- Kyle
Stuart -- Jacob
}
Program file Friends.java
-------------------------
// This program reads a Graphviz graph file of friendships and allows the user
// to find the distance between two people in the graph.
import java.io.*;
import java.util.*;
public class Friends {
public static void main(String[] args) throws FileNotFoundException {
System.out.println("Welcome to the cse143 friend finder.");
Scanner input = new Scanner(new File("friends.dot"));
Map<String, Set<String>> friends = readFile(input);
Scanner console = new Scanner(System.in);
System.out.print("starting name? ");
String name1 = console.next();
if (!friends.containsKey(name1)) {
System.out.println("That person is not in the data file.");
} else {
System.out.print("target name? ");
String name2 = console.next();
showMatches(friends, name1, name2);
}
}
// pre : input is open and contains a legal Graphviz file of friendship
// connections where each friend is listed as a single token
// post: returns a map that contains for each person the set of friends for
// that person
public static Map<String, Set<String>> readFile(Scanner input) {
Map<String, Set<String>> friends = new TreeMap<String, Set<String>>();
while (input.hasNextLine()) {
String line = input.nextLine();
if (line.contains("--")) {
Scanner lineData = new Scanner(line);
String name1 = lineData.next();
lineData.next(); // this skips the "--" token
String name2 = lineData.next();
addTo(friends, name1, name2);
addTo(friends, name2, name1);
}
}
return friends;
}
// post: computes the distance between two people, printing the various
// lists of friends with their distance from name1
public static void showMatches(Map<String, Set<String>> friends,
String name1, String name2) {
Set<String> alreadySeen = new TreeSet<String>();
Set<String> currentGroup = new TreeSet<String>();
currentGroup.add(name1);
int distance = 0;
System.out.println();
System.out.println("Starting with " + name1);
while (!currentGroup.contains(name2) && !currentGroup.isEmpty()) {
distance++;
alreadySeen.addAll(currentGroup);
Set<String> nextGroup = new TreeSet<String>();
for (String friend : currentGroup) {
nextGroup.addAll(friends.get(friend));
}
nextGroup.removeAll(alreadySeen);
currentGroup = nextGroup;
System.out.println(" " + distance + " away: " + currentGroup);
}
if (currentGroup.contains(name2)) {
System.out.println("found at a distance of " + distance);
} else {
System.out.println("not found");
}
}
// post: records a friendship for name1. If name1 is not in the map, a new
// set is added to the map
public static void addTo(Map<String, Set<String>> friends, String name1,
String name2) {
if (!friends.containsKey(name1)) {
friends.put(name1, new TreeSet<String>());
}
friends.get(name1).add(name2);
}
}
]]>