Skip to content

Commit e8821bc

Browse files
committed
08
1 parent 422b88d commit e8821bc

File tree

1 file changed

+6
-1
lines changed

1 file changed

+6
-1
lines changed

2025/Day08/README.md

Lines changed: 6 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,11 @@
11
## --- Day 8: Playground ---
2+
<em>
23
Equipped with a new understanding of teleporter maintenance, you confidently step onto the repaired teleporter pad.
34

45
You 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.

0 commit comments

Comments
 (0)