.. _program_listing_file_src_greedy.cpp:

Program Listing for File greedy.cpp
===================================

|exhale_lsh| :ref:`Return to documentation for file <file_src_greedy.cpp>` (``src/greedy.cpp``)

.. |exhale_lsh| unicode:: U+021B0 .. UPWARDS ARROW WITH TIP LEFTWARDS

.. code-block:: cpp

   
   #include "cvrp/greedy.hpp"
   
   #include <iostream>
   #include <numeric>
   
   GreedySolution::GreedySolution(
       const std::vector<Node>& nodes, const std::vector<Vehicle>& vehicles,
       const std::vector<std::vector<double>>& distanceMatrix)
       : Solution(nodes, vehicles, distanceMatrix) {}
   
   GreedySolution::GreedySolution(const Problem& p)
       : Solution(p.nodes_, p.vehicles_, p.distanceMatrix_) {}
   
   void GreedySolution::Solve() {
     for (auto& v : vehicles_) {
       while (true) {
         const auto [found, closest_node] = find_closest(v);
         if (found && v.load_ - closest_node.demand_ >= 0) {
           v.load_ -= closest_node.demand_;
           v.cost_ += distanceMatrix_[v.nodes_.back()][closest_node.id_];
           v.nodes_.push_back(closest_node.id_);
           nodes_[closest_node.id_].is_routed_ = true;
         } else {
           v.cost_ += distanceMatrix_[v.nodes_.back()][depot_.id_];
           v.nodes_.push_back(depot_.id_);
           break;
         }
       }
     }
   
     double cost = std::accumulate(
         std::begin(vehicles_), std::end(vehicles_), 0.0,
         [](const double sum, const Vehicle& v) { return sum + v.cost_; });
     std::cout << "Cost: " << cost << '\n';
     for (const auto& i : nodes_) {
       if (!i.is_routed_) {
         std::cout << "Unreached node: " << '\n';
         std::cout << i << '\n';
       }
     }
     std::cout << "Solution valid: " << CheckSolutionValid() << '\n';
   }