gistfile1.java

public List getRoute(myNode start, myNode end){
	//initialise variables
	myNode actual = end;
	myNodeList wayBack = new myNodeList();
	wayBack.add(end);
	myNodeList way = new myNodeList();
	
	//find the minimum spanning tree with end
	myNodeMap map = this.spanner.span(this.g, start);
	
	//get a list from end to start
	while(!start.equals(actual)){
		actual = map.get(actual);
		wayBack.add(actual);
	}
	//revert list
	while(!wayBack.isEmpty()){
		way.add(wayBack.removeLast());
	}
	return way;
}