Add solution for "Day 23: LAN Party", part 1

This commit is contained in:
2024-12-25 21:06:41 +01:00
parent e0a9a807da
commit c783d20755
8 changed files with 283 additions and 0 deletions

32
include/aoc/Graph.hpp Normal file
View File

@@ -0,0 +1,32 @@
// Solutions to the Advent Of Code 2024.
// Copyright (C) 2024 Stefan Müller
//
// This program 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, either version 3 of the License, or (at your option) any later
// version.
//
// This program 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
// this program. If not, see <http://www.gnu.org/licenses/>.
#pragma once
#include <map>
#include <memory>
#include <vector>
#include <aoc/Vertex.hpp>
class Graph
{
public:
const std::map<std::string, std::shared_ptr<Vertex>>& getVertices() const;
void addEdge(const std::string& vertexId1, const std::string& vertexId2);
private:
std::map<std::string, std::shared_ptr<Vertex>> vertices_;
std::shared_ptr<Vertex> findOrAddVertex(const std::string& vertexId);
};

34
include/aoc/LanParty.hpp Normal file
View File

@@ -0,0 +1,34 @@
// Solutions to the Advent Of Code 2024.
// Copyright (C) 2024 Stefan Müller
//
// This program 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, either version 3 of the License, or (at your option) any later
// version.
//
// This program 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
// this program. If not, see <http://www.gnu.org/licenses/>.
#pragma once
#include <aoc/Graph.hpp>
#include <aoc/Solver.hpp>
class LanParty : public Solver
{
public:
std::string getPuzzleName() const override;
std::string getInputFileName() const override;
void processDataLine(const std::string& line) override;
void finish() override;
private:
Graph lan_;
void countInterconnectedThreeSets(const Vertex& vertexTx);
bool shallProcessVertex(const Vertex& vertexToCheck, const Vertex& vertexTx) const;
const std::string getFirstTxComputerName() const;
const std::string getLastTxComputerName() const;
};

32
include/aoc/Vertex.hpp Normal file
View File

@@ -0,0 +1,32 @@
// Solutions to the Advent Of Code 2024.
// Copyright (C) 2024 Stefan Müller
//
// This program 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, either version 3 of the License, or (at your option) any later
// version.
//
// This program 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
// this program. If not, see <http://www.gnu.org/licenses/>.
#pragma once
#include <memory>
#include <string>
#include <vector>
class Vertex
{
public:
Vertex(const std::string id);
std::string getId() const;
const std::vector<std::weak_ptr<Vertex>>& getNeighbors() const;
void addNeighbor(const std::shared_ptr<Vertex>& neighbor);
private:
std::string id_;
std::vector<std::weak_ptr<Vertex>> neighbors_;
};