private void printFinalPath(){
        System.out.println();
        int [][] tempMap = new int [25][50];
        for (int i = 0; i < path.size(); i++){
            Node temp = path.get (i);            
            tempMap[temp.getY()][temp.getX()] = temp.getStartCost();
        }

        tempMap[endY][endX] = -1;

        for (int Y = 0; Y < 25; Y++){
            for (int X = 0; X < 50; X++){
                if (tempMap[Y][X] != 0){
                    System.out.print (tempMap[Y][X] + "  ");
                }
                else{
                    System.out.print (0 + "  ");
                }
            }
            System.out.println();
        }
    }