GNU/Linux ◆ xterm-kitty ◆ zsh 49 views

Visualization of my Advent of Code solution for 2024, day 18, part 2. Different colors represent connected components, where a node is connected to both its orthogonal and diagonal neighbors. The algorithm stops when it finds a single connected component that connects two or more boundaries, except two edge cases that do not block movement - can you guess which two? :)