Commit Graph

2 Commits

Author SHA1 Message Date
xenia bcce377a7d day 7: cleaned up version using graph-lib
this was a pain in the ass to write vs the initial implementation, but
it's a lot more efficient due to not revisiting nodes that are already
visited. i would warrant it's as efficient as possible at this point

also, both part1 and part2 use the generalized do-dfs form provided by
the graph package
2020-12-07 02:35:26 -05:00
xenia 3f4c2dea09 day 7: initial implementation (it's very spaghet) 2020-12-07 00:34:21 -05:00