Vertex.java

import java.util.LinkedList;
import java.util.List;
//added the code below
import java.util.HashMap;

public class Vertex implements Comparable<Vertex> {
	public String name;
	private List<Edge> adjacent;
	public int posX = 0;
	public int posY = 0;

	// added the variables below:
	public boolean visited;
	public int pathCost;
	public Vertex previousPointer;
	public HashMap<Vertex, Integer> vertices;
	public double weightedCost;

	/**
	 * Construct a new vertex containing an adjacency list.
	 * 
	 * @param vertexName
	 *            a unique identifier for this vertex.
	 * @param x
	 *            the x coordinate for this vertex
	 * @param y
	 *            the y coordinate for this vertex
	 */
	public Vertex(String vertexName, int x, int y) {
		name = vertexName;
		adjacent = new LinkedList<Edge>();
		posX = x;
		posY = y;

		// added the initialization below
		pathCost = Integer.MAX_VALUE;
		visited = false;
		previousPointer = null;
		vertices = new HashMap<Vertex, Integer>();
		weightedCost = Integer.MAX_VALUE;
	}

	/**
	 * Construct a new vertex containing an adjacency list.
	 * 
	 * @param vertexName
	 *            a unique identifier for this vertex.
	 */
	public Vertex(String vertexName) {
		this(vertexName, 0, 0);
	}

	/**
	 * Retrieve the list of edges connected to this vertex.
	 * 
	 * @return a list of edges connected to this vertex.
	 */
	public List<Edge> getEdges() {
		return adjacent;
	}

	/**
	 * Connect an edge to this vertex.
	 * 
	 * @param e
	 *            The new edge to connect to this vertex.
	 */
	public void addEdge(Edge e) {
		adjacent.add(e);
	}

	public String toString() {
		return name;
	}

	public int compareTo(Vertex v) {
		Double thisWeightedCost = this.weightedCost;
		Double vWeightedCost = v.weightedCost;
		return (thisWeightedCost.compareTo(vWeightedCost));

	}
}