Placed 20th on part 1; 4th on part 2.
Problem: https://adventofcode.com/2021/day/12
Code: https://github.com/jonathanpaulson/Ad...
Adjacency lists are almost always the best data structure to represent graphs.
Is there a faster algorithm than tracing out all the paths?