File tree Expand file tree Collapse file tree 1 file changed +6
-1
lines changed
Expand file tree Collapse file tree 1 file changed +6
-1
lines changed Original file line number Diff line number Diff line change 11## --- Day 8: Playground ---
2+ <em >
23Equipped with a new understanding of teleporter maintenance, you confidently step onto the repaired teleporter pad.
34
45You rematerialize on an unfamiliar teleporter pad and find yourself in a vast underground space which contains a giant playground!
56
6- _ Visit the website for the full story and [ full puzzle] ( https://adventofcode.com/2025/day/8 ) description._
7+ Visit the website for the full story and [ full puzzle] ( https://adventofcode.com/2025/day/8 ) description.
8+ </em >
9+
10+ I decided to go with two implementations of Kruskal's algorithm, as part one and two are different enough. I didn't use a
11+ disjoint set representation. It's fast enough this way as well, and switching to disjoint sets would just make the code longer.
You can’t perform that action at this time.
0 commit comments