#ifndef GRAPH_ATTRIBUTES_H
#define GRAPH_ATTRIBUTES_H

#include <numeric>
#include "graph.hpp"

namespace ED
{
   struct GraphAttributes
   {
      explicit GraphAttributes(NodeId num_nodes);

      [[nodiscard]] NodeId num_nodes() const;

      [[nodiscard]] bool is_outer(NodeId id) const;

      [[nodiscard]] bool is_inner(NodeId id) const;

      [[nodiscard]] bool is_out_of_forest(NodeId id) const;

      void reset_forest();

      void reset_matching();

      std::vector<NodeId> phi;
      std::vector<NodeId> rho;
      std::vector<NodeId> mu;
      std::vector<bool> scanned;
   };

   inline
   GraphAttributes::GraphAttributes(const ED::NodeId num_nodes):
      phi(num_nodes),
      rho(num_nodes),
      mu(num_nodes),
      scanned(num_nodes)
   {

   }

   inline
   NodeId GraphAttributes::num_nodes() const
   {
      assert(phi.size() == rho.size());
      assert(phi.size() == mu.size());
      assert(phi.size() == scanned.size());
      return phi.size();
   }

   inline
   bool GraphAttributes::is_outer(NodeId const id) const {
      return mu[id] == id or phi[mu[id]] != mu[id];
   }

   inline
   bool GraphAttributes::is_inner(NodeId const id) const
   {
      return phi[id] != id and phi[mu[id]] == mu[id];
   }

   inline
   bool GraphAttributes::is_out_of_forest(const ED::NodeId id) const
   {
      return mu[id] != id and phi[id] == id and phi[mu[id]] == mu[id];
   }

   inline
   void GraphAttributes::reset_forest()
   {
      std::iota(phi.begin(), phi.end(), 0);
      std::iota(rho.begin(), rho.end(), 0);
      std::fill(scanned.begin(), scanned.end(), false);
   }

   inline
   void GraphAttributes::reset_matching()
   {
      std::iota(mu.begin(), mu.end(), 0);
   }
}
#endif //GRAPH_ATTRIBUTES_H