import java.util.Map.Entry;


public class DegreeOfSeperation {

	public static void main(String[] args) {
		// TODO Implement
	}

}

class Vertex {
	
	public boolean isAdjacent() {
		// TODO Implement
		return false;
	}
	
	public Entry<Vertex, Integer>[] getNeighbors() {
		// TODO Implement
		return null;
	}
}
@@ -142,26 +142,24 @@
 ertex %7B%0A
-%09%0A
 %09public 
 boolean 
@@ -154,65 +154,600 @@
 lic 
-boolean isAdjacent() %7B%0A%09%09// TODO Implement%0A%09%09return false
+static String INPUT_FILENAME = %22facebook_combined.txt%22;%0A%09private int id;%0A%09private boolean initialized;%0A%09private boolean visited;%0A%09private double costFromStart;%0A%09private Entry%3CVertex, Integer%3E%5B%5D neighbors;%0A%09%0A%09public Vertex(int id) %7B%0A%09%09this.id = id;%0A%09%09this.initialized = false;%0A%09%09this.visited = false;%0A%09%09this.costFromStart = Double.POSITIVE_INFINITY;%0A%09%7D%0A%09%0A%09public double getCostFromStart() %7B%0A%09%09return costFromStart;%0A%09%7D%0A%09%0A%09public boolean setCostFromStartIfSmaller(double newCost) %7B%0A%09%09boolean setSuccess = false;%0A%09%09if(newCost %3C costFromStart) %7B%0A%09%09%09costFromStart = newCost;%0A%09%09%7D%0A%09%09return setSuccess
 ;%0A%09%7D
@@ -834,12 +834,16 @@
 n null;%0A
-
 %09%7D%0A
+%09%0A%09%0A
 %7D

Implement constructor, getCostFromStart(), setCostFromStartIfSmaller in Vertex