✅ A* Algorithm Get Node where x and y is 1 less (Neigbour)

public class PathNode
{
    private double width;
    private double height;
    public double x;
    public double y;
    //private List<double> neighbours;
    private bool closed = false;
    private bool walkable = true;
    public PathNode(double width, double height, double x, double y)
    {
        this.x = x;
        this.y = y;
        this.width = width;
        this.height = height;
    }
    public bool barrierNode()
    {
        return walkable = false;
    }
    public void updateNeighbours(List<PathNode> panelNodes)
    {
        if (x < width - 1 /* Code Here to get the pathnode with x - 1 and y -1*/ )
        {

        }
    }
}

public class PathNode
{
    private double width;
    private double height;
    public double x;
    public double y;
    //private List<double> neighbours;
    private bool closed = false;
    private bool walkable = true;
    public PathNode(double width, double height, double x, double y)
    {
        this.x = x;
        this.y = y;
        this.width = width;
        this.height = height;
    }
    public bool barrierNode()
    {
        return walkable = false;
    }
    public void updateNeighbours(List<PathNode> panelNodes)
    {
        if (x < width - 1 /* Code Here to get the pathnode with x - 1 and y -1*/ )
        {

        }
    }
}