AoC update

i skipped all of the ones i didn't do and did day 25 turns out you can't finish it unless you have solved all the previous puzzles 🫠

day 25 was a graph problem, i used petgraph to solve it, checked out the reddit solutions

the algorithm needed to solve the problem is Stoer–Wagner algorithm, it helps you determine the minimum number edges you need to cut to turn a graph into two disjointed loops.

if i learned one thing from this year's advent of code, it's that i don't know anything about graph theory, if any of you have a good resource for learning it, please share it in the comments

[part 1 solution]

i don't know how they calculate it but this is a cool idea

https://github-worth.vercel.app/

here is how it works

https://t.me/frectonzchat/5282

[source]

AASTU is way better than AAU
how the heck did they get this guy to give a talk

https://t.me/AASTUSE/2612

currently in history of art class
learning about "post impressionism"
at least I will be able to talk snobbishly about paintings after this 😁

search and replace == generics

this is just pure genius 🤣

3d printers are the closest thing we have to self replicating machines

https://reprap.org

here is an old but interesting talk

sadly the modern 3d printing industry has taken the route of the printer companies business model of selling the ink instead of perusing the exponential growth allowed by self replicating machines

the world needs a von neumann biopic