<ul><li>Advent of Code 2024 - Day 23: LAN Party</li><li>Today's challenge was rather run, and somewhat simple (or at least Part 1 was).</li><li>Collect all the connections in trios where any of the triangles computers begin with t.</li><li>To achieve this we create a mapping of node -> connections (neighbors).</li><li>On part 2 we need to find the largest set of inter-connected computers.</li><li>The Bron-Kerbosch algorithm is used to find the largest groups (called cliques) in a graph.</li><li>Finding the largest clique by brute force (trying every possible group) is slow for large inputs.</li><li>The Bron-Kerbosch algorithm makes this process faster by:</li><li>Starting with smaller groups (subsets) and expanding them.</li><li>Stopping early when a group can’t grow into a larger clique.</li></ul>

Advent of Code 2024 - Day 23: LAN Party

Discover more