From 4b1dab72a5ebd406845edaea284bc5dadf8c9d26 Mon Sep 17 00:00:00 2001
From: Adam Millerchip <adam@millerchip.net>
Date: Fri, 11 Dec 2020 01:04:13 +0900
Subject: [PATCH] clearer lines

---
 day10/README | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/day10/README b/day10/README
index d5bb337..1bb81bc 100644
--- a/day10/README
+++ b/day10/README
@@ -37,13 +37,13 @@ forms a directed graph, where the weight of each node inherits the weight of all
 For the example case (excuse my ascii drawing skills):
 
 0(1)-1(1)-4(1)-5(1)-|
-           |  ` |   |
+           |  \ |   |
            |---6(2) |
            |    |   |
            |---7(4)-|
                 |
                10(4)-11(4)
-                   ` |
+                   \ |
                      12(8)-18(8)-19(8)
 
 So just need to make an algorithm that builds this graph, by iterating the sorted list