layered_precedence_graph_components.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_COMPONENTS_H_
#define DAISI_CPPS_LOGICAL_ALGORITHMS_ASSIGNMENT_LAYERED_PRECEDENCE_GRAPH_COMPONENTS_H_
 
#include <memory>
#include <optional>
 
#include "datastructure/directed_graph.tpp"
#include "material_flow/model/material_flow.h"
#include "utils/structure_helpers.h"
 
namespace daisi::cpps::logical {
 
enum class PrecedenceGraphLayer { kFree, kSecond, kHidden, kScheduled, kNone };
 
struct LPCVertex {
  explicit LPCVertex(material_flow::Task task) : task(std::move(task)){};
 
  material_flow::Task task;
 
  PrecedenceGraphLayer layer = PrecedenceGraphLayer::kNone;
 
  std::optional<util::Duration> latest_finish = std::nullopt;
 
  std::optional<util::Duration> earliest_valid_start = std::nullopt;
 
  bool scheduled = false;
 
  friend bool operator==(const LPCVertex &v1, const LPCVertex &v2) { return v1.task == v2.task; }
 
  friend bool operator!=(const LPCVertex &v1, const LPCVertex &v2) { return v1.task != v2.task; }
};
 
}  // namespace daisi::cpps::logical
 
#endif