Day 15 solution

Heavily cribbed from https://github.com/encse/adventofcode/blob/master/2021/Day15/Solution.cs but transformed to be more my style. At its core, this is just "implement Dijkstra", so I feel no shame in using an existing implementation of a known algorithm. :)
2021-12-15 10:50:33 -06:00
parent aaf31ed7b1
commit 5f830051e8
4 changed files with 216 additions and 1 deletions
--- a/advent-of-code-2021.csproj
+++ b/advent-of-code-2021.csproj
@ -60,6 +60,9 @@
 	  <None Update="inputs\14.txt">
 	    <CopyToOutputDirectory>PreserveNewest</CopyToOutputDirectory>
 	  </None>
+	  <None Update="inputs\15.txt">
+	    <CopyToOutputDirectory>PreserveNewest</CopyToOutputDirectory>
+	  </None>
 	</ItemGroup>

 </Project>