day23, part2

day23/notes.org

@@ -76,3 +76,50 @@ so 4,10 and 3,11 should be visited separately.
 6,17 is where they join and the point which should have second entry
 ** allright, ugh. my new solution is memory hogging.
 maybe i can draw the stuff and it will be several neat thingies
+* maybe new approach?
+make a graph. with vertices of Start, End and Crossroads.
+yes.
+let's create a graph representation.
+** so, from A to AG
+i think i can do this manually now
+** distances are
+39
+244
+184
+154
+214
+378
+144
+190
+40
+184
+152
+172
+166
+102
+158
+166
+140
+118
+108
+268
+110
+72
+56
+142
+146
+110
+128
+190
+108
+174
+77
+1
+** again?
+no, let's write code.
+** didn't count all the way
+2023/12/23 15:55:55 at {index:30 c:{Row:125 Col:137} name:f} to {index:31 c:{Row:140 Col:139} name:g} cur dist is 3997.		|max so far 6406|
+signal: interrupt
+FAIL	sunshine.industries/aoc2023/day23	380.499s
+
+tried more or less stable value, and interrupted