Vertex.java

import java.util.LinkedList;


public class Vertex{
	public int index;
	public Vertex predecessor;
	public int currentCost;
	public boolean visited;
	public LinkedList<Vertex> neighbors;
	
	public Vertex(){
		this.predecessor = this;
		this.currentCost = 0;
		this.neighbors = new LinkedList<Vertex>();
	}
	
	public Vertex(int id, int chave){
		this.index = id;
		this.currentCost = chave;
	}
	
	public Vertex[] getNeighbors(){
		Vertex[] neighbors = new Vertex[this.neighbors.size()];
		for( int i = 0; i < this.neighbors.size(); i++ ){
			neighbors[i] = this.neighbors.get(i);
		}
		return neighbors;
	}
	
	public Vertex getNeighbor(int i){
		return this.neighbors.get(i);
	}
	
	public Vertex GetMinimumNeighbor(){
		Vertex vertexMin = null;
		if(this.neighbors.size() > 0)
			vertexMin = this.neighbors.get(0);
		for(int i = 0; i < this.neighbors.size(); i++){
			if(this.getNeighbor(i).currentCost < vertexMin.currentCost)
				vertexMin = this.getNeighbor(i);
		}
		return vertexMin;	
	}
}