JoelForkTest/Game1/Sources/Pathing/A-Star/PathSaver/Path.cs

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;
using Microsoft.Xna.Framework;
using Microsoft.Xna.Framework.Input;
using Microsoft.Xna.Framework.Graphics;

class Path
{
    private Nodes[] nodes = new Nodes[512];
    private int Count = 0;

    public void AddNode(Nodes node)
    {
        nodes[Count] = new Nodes(node);
        Count++;
    }

    public Nodes Reduce()
    {
        Count--;
        Nodes temp = nodes[0];

        for (int i = 0; i < Count; i++)
        {
            nodes[i] = nodes[i + 1];
        }
        nodes[Count + 1] = null;
        return temp;
    }

    public Path FlipArray()
    {
        int j = Count;
        Nodes[] tempp = nodes;
        Nodes[] newnode = new Nodes[Count];
        Path newPath = new Path();
        for (int i = 0; i < Count; i++)
        {
            newnode[i] = tempp[j - 1];
            j--;
            newPath.AddNode(newnode[i]);
        }
        return newPath;
    }

    public Nodes getFinalDest()
    {
        return nodes[Count];
    }

    public int getCount()
    {
        return Count;
    }

    public Nodes getByIndex(int i)
    {
        return nodes[i];
    }


    /* 
    private int Count = 0;
    private int Cost = 0;
    private int Efficency;


    public Nodes getNode(int i)
    {

        return nodes[i];
    }
    
    public void setNode(Vector2 newNode)
    {
        nodes[Count] = new Nodes(10, newNode);
        Count++;
    }

    public Nodes Reduce()
    {
        Count--;
        Nodes temp = nodes[0];

        for (int i = 0; i < Count; i++)
        {
            nodes[i] = nodes[i + 1];
        }

        return temp;
    }

    public Nodes getFinalDest()
    {
        return nodes[Count];
    }

    public int getCount()
    {
        return Count;
    }

    public Nodes getFirst()
    {
        return nodes[0];
    }
    
    public Nodes getByIndex(int i)
    {
        return nodes[i];
    }

    public int getEfficency()
    {
        return Efficency;
    }

    private void calculateEfficency()
    {
        for (int i = 0; i < Count; i++)
        {
            Efficency = Efficency + nodes[i].getCost();
        }
    }

    public int getCost()
    {
        return Cost;
    }

    public void setCost(Crops Crop)
    {

    }

    */
}