35 lines
1.3 KiB
C++
35 lines
1.3 KiB
C++
|
// 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;
|
|||
|
|
};
|