layered_precedence_graph.h

// Copyright 2023 The SOLA authors
//
// This file is part of DAISI.
//
// DAISI is free software: you can redistribute it and/or modify it under the terms of the GNU
// General Public License as published by the Free Software Foundation; version 2.
//
// DAISI is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even
// the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General
// Public License for more details.
//
// You should have received a copy of the GNU General Public License along with DAISI. If not, see
// <https://www.gnu.org/licenses/>.
//
// SPDX-License-Identifier: GPL-2.0-only
 
#ifndef DAISI_CPPS_LOGICAL_ALGORITHMS_ASSIGNMENT_LAYERED_PRECEDENCE_GRAPH_H_
#define DAISI_CPPS_LOGICAL_ALGORITHMS_ASSIGNMENT_LAYERED_PRECEDENCE_GRAPH_H_
 
#include <memory>
#include <optional>
 
#include "cpps/common/cpps_logger_ns3.h"
#include "datastructure/directed_graph.tpp"
#include "layered_precedence_graph_components.h"
#include "material_flow/model/material_flow.h"
#include "utils/structure_helpers.h"
 
namespace daisi::cpps::logical {
 
class LayeredPrecedenceGraph : private datastructure::DirectedGraph<LPCVertex, std::monostate> {
public:
  explicit LayeredPrecedenceGraph(std::shared_ptr<material_flow::MFDLScheduler> scheduler,
                                  const std::string &connection_string);
 
  ~LayeredPrecedenceGraph() = default;
 
  void next();
 
  std::vector<material_flow::Task> getAuctionableTasks() const;
 
  void setEarliestValidStartTime(const std::string &task_uuid, const util::Duration &time);
 
  void setLatestFinishTime(const std::string &task_uuid, const util::Duration &time);
 
  util::Duration getEarliestValidStartTime(const std::string &task_uuid) const;
 
  util::Duration getLatestFinishTime(const std::string &task_uuid) const;
 
  material_flow::Task getTask(const std::string &task_uuid) const;
 
  bool areAllTasksScheduled() const;
 
  bool areAllFreeTasksScheduled() const;
 
  void setTaskScheduled(const std::string &task_uuid);
 
  bool isFreeTaskScheduled(const std::string &task_uuid) const;
 
  bool isTaskFree(const std::string &task_uuid) const;
 
  std::vector<material_flow::Task> getTasks() const;
 
private:
  void initLayers();
 
  void updateLayersSecondToFree(const LPCVertex &t);
 
  void updateLayersHiddenToSecond(const LPCVertex &t_dash);
 
  std::vector<LPCVertex> getLayerVertices(PrecedenceGraphLayer layer) const;
 
  LPCVertex getVertex(const std::string &task_uuid) const;
};
 
}  // namespace daisi::cpps::logical
 
#endif