adam/AdventOfCode
1
0
Fork 0
Code Issues Pull requests Projects Releases Wiki Activity

Tree -> DAG

Browse source
This commit is contained in:
Adam Millerchip 2020-12-08 01:49:07 +09:00
parent b2503c0e5b
commit dbf14680ba
1 changed files with 4 additions and 0 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

4
day7/README
View file

@ -37,3 +37,7 @@ Just walk the tree counting the children as we go.
Wondering if my use of MapSet for the inverted tree was overkill, simpler way?
I *think* I got the fundamental idea of this one, rather than just hacking together whatever works,
but seeing the other answers will be the judge of that :-)
** Update **
I should have said DAG rather than tree, as each node can have multiple parents.