From dbf14680ba4a3f2487b11745f4ef165e2ab99501 Mon Sep 17 00:00:00 2001
From: Adam Millerchip <adam@millerchip.net>
Date: Tue, 8 Dec 2020 01:49:07 +0900
Subject: [PATCH] Tree -> DAG

---
 day7/README | 4 ++++
 1 file changed, 4 insertions(+)

diff --git a/day7/README b/day7/README
index dc4ac68..663bb6b 100644
--- a/day7/README
+++ b/day7/README
@@ -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.