public Point[] reverse(Point[] path) {
        Point[] newPath = new Point[path.length -1];
        int k = 0;
        for(int i = path.length - 1; i >= 0; i--) {
            newPath[i] = path[k++];
        }
        return newPath;
    }