mkasztelnik
ColaCheng
cblavier
My take on day6 : https://github.com/cblavier/advent/tree/master/lib/2019/day6
Not so much code, and I think my solution is elegant. But it took me hours to write it because I was heading into an algorithm way too complicated until I got enlighted 
Still, it was a lot of fun, again!
alvises
I didn’t know about digraph… so to solve part2 I had to (painfully 
) implement functions to create a graph (represented by a map of verteces and neighbors) and a sort of Dijkstra min path to find the minimum transitions needed..
Going see now how much time I could save with digraph.. 
Update: digraph… great tool, it took much less. I’ve just added the digraph
version as well.
JEG2
aaronnamba
A lot of people seem to have interpreted this as a graph problem. While not technically incorrect, it’s much simpler if you think of it as a tree. To solve part 2, forget Dijkstra, just find the common ancestor of YOU and SAN.
mindok
I saw a lot of mentions of Erlang’s digraph library. Out of interest, did anyone take a look at GitHub - bitwalker/libgraph: A graph data structure library for Elixir projects · GitHub - an Elixir graph library implementation?
KalvinHom
my solution
Did not use digraph, i just traversed the tree of SAN for distances, and then found YOU’s intersection with it.