private LinkedList<Direction> getPath(){
		LinkedList<Direction> result = new LinkedList<Direction>();
		
		ArrayList<Node> openlist = new ArrayList<Node>();
		ArrayList<Node> closedlist = new ArrayList<Node>();
		
		Node firstNode = new Node(null, start.x, start.y);
		openlist.add(firstNode);
		
		while(!openlist.isEmpty() && finalNode == null){
			getNodeLowestF(openlist).checkNeighbours(map, openlist, closedlist);
		}
		
		Node node = finalNode;
		while(true){
			Direction dir = node.getDirection();
			if(dir != null)
				result.addFirst(dir);
			
			if(node.parent != null){
				node = node.parent;
			}else break;
		}
		
		return result;
	}