feat: debug day 16 input

Author: Flashky

src/main/java/com/adventofcode/flashk/day16/ReindeerMaze.java

@@ -70,7 +70,9 @@ private long dijkstra(Tile start) {
 
         // Initialize start tile
         start.setScore(0);
-        start.setDirection(Vector2.right());
+        if(start.getDirection() == null) {
+            start.setDirection(Vector2.right());
+        }
 
         // Execute dijkstra
         PriorityQueue<Tile> tiles = new PriorityQueue<>();
@@ -171,14 +173,14 @@ public long solveB(){
                 if(adjacentScore == score) {
                     fillPath(adjacent, endTile);
                     fillPath(adjacent, startTile);
-                    paint();
+
                     System.out.println();
                 }
             }
         }
         // Pasada 2, buscamos caminos alternativos en cada una de las intersecciones.
 
-        //paint();
+        paint();
         return countPathTiles();
     }
 

src/test/java/com/adventofcode/flashk/day16/Day16Test.java

@@ -190,7 +190,7 @@ public void testSolvePart2Input() {
 		System.out.println("Solution: "+reindeerMaze.solveB());
 
 		// 512 -> too low
-		
+
 		assertEquals(0L,0L);
 
 	}