AStarState.h

#pragma once

#include "Graphs.h"
#include "TiledGraphNode.h"
#include "TiledGraphEdge.h"

namespace Eegeo
{
    namespace Graphs
    {
        struct AStarState
        {
            AStarState()
                : m_prior(-1)
                , m_costToTraverseEdge(0.f)
                , m_f(0.f)
                , m_g(0.f)
                , m_h(0.f)
                , m_closed(false)
            {}

            AStarState(
                const TiledGraphEdgeId& graphEdgeId,
                int prior,
                float costToTraverseEdge,
                float f,
                float g,
                float h,
                bool closed
            )
                : m_graphEdgeId(graphEdgeId)
                , m_prior(prior)
                , m_costToTraverseEdge(costToTraverseEdge)
                , m_f(f)
                , m_g(g)
                , m_h(h)
                , m_closed(closed)
            {}


            const TiledGraphEdgeId& GetGraphEdgeId() const { return m_graphEdgeId; }
            const int Prior() const { return m_prior; }
            float GetCostToTraverseEdge() const { return m_costToTraverseEdge; }
            float F() const { return m_f; }
            float G() const { return m_g; }
            float H() const { return m_h; }
            bool IsClosed() const { return m_closed; }

            void Close() { m_closed = true; }
            void Update(int prior, float g)
            {
                m_prior = prior;
                m_g = g;
                m_f = m_g + m_h;
            }


        private:
            TiledGraphEdgeId m_graphEdgeId;
            int m_prior;
            float m_costToTraverseEdge;
            float m_f;
            float m_g;
            float m_h;
            bool m_closed;
        };

    }
}