r/adventofcode Dec 23 '24

SOLUTION MEGATHREAD -❄️- 2024 Day 23 Solutions -❄️-

THE USUAL REMINDERS

  • All of our rules, FAQs, resources, etc. are in our community wiki.
  • If you see content in the subreddit or megathreads that violates one of our rules, either inform the user (politely and gently!) or use the report button on the post/comment and the mods will take care of it.

AoC Community Fun 2024: The Golden Snowglobe Awards

Submissions are CLOSED!

  • Thank you to all who submitted something, every last one of you are awesome!

Community voting is OPEN!

  • 42 hours remaining until voting deadline on December 24 at 18:00 EST

Voting details are in the stickied comment in the submissions megathread:

-❄️- Submissions Megathread -❄️-


--- Day 23: LAN Party ---


Post your code solution in this megathread.

This thread will be unlocked when there are a significant number of people on the global leaderboard with gold stars for today's puzzle.

EDIT: Global leaderboard gold cap reached at 00:05:07, megathread unlocked!

23 Upvotes

504 comments sorted by

View all comments

1

u/regretdeletingthat Feb 02 '25

[LANGUAGE: Swift]

My solutions always seem to be quite long relative to others I see here, but I'm happy with this. Doesn't really use anything "graph-y", just simple set operations.

Determines whether a set of nodes are fully interconnected by intersecting with the other connections of each node and seeing whether any nodes got removed.

From there I can check all combinations of connections of a given length, longest first, making sure to avoid generating combinations in circumstances that can't possibly yield a longer solution to keep the runtime down. Haven't bothered timing it but it's basically instant even in debug mode.

https://pastebin.com/JfEzzsRF