View difference between Paste ID: DMprKQAN and TRBzCULe

 class GraphNode<E> {
 	private int index; // index of vertex
 	private E info;
 	private LinkedList<GraphNode<E>> neighbors;
 
 	public GraphNode(int index, E info) {
 		this.index = index;
 		this.info = info;
 		neighbors = new LinkedList<GraphNode<E>>();
 	}
 
 	boolean containsNeighbor(GraphNode<E> o) {
 		return neighbors.contains(o);
 	}
 
 	void addNeighbor(GraphNode<E> o) {
 		neighbors.add(o);
 	}
 
 	void removeNeighbor(GraphNode<E> o) {
 		if (neighbors.contains(o))
 			neighbors.remove(o);
 	}
 
 	@Override
 	public String toString() {
 		String ret = "INFO:" + info + " Neighbors:";
 		for (int i = 0; i < neighbors.size(); i++)
 			ret += neighbors.get(i).info + "
 		return ret;
 	}
 
 	@Override
-	public boolean equals(Object obj) {
+	public boolean equals(Object obj)
-		@SuppressWarnings("unchecked")
+
 		return (pom.info.equals(this.info));
 	}
 	public int getIndex() {
 		return index;
 	}
 	public void setIndex(int index) {
 		this.index = index;
 	}
 
 	public E getInfo() {
 		return info;
 	}
 
 	public void setInfo(E info) {
 		this.info = info;
 	}
 
 	public LinkedList<GraphNode<E>> getNeighbors() {
 		return neighbors;
 	}
 
 	public void setNeighbors(LinkedList<GraphNode<E>> neighbors) {
 		this.neighbors = neighbors;
 	}
 }