refactor: use bfs utility in older code

Author: believer

go/2024/puzzles/day12/main.go

@@ -3,6 +3,7 @@ package main
 import (
 	"fmt"
 
+	"github.com/believer/aoc-utils/algorithms/bfs"
 	"github.com/believer/aoc-utils/files"
 	"github.com/believer/aoc-utils/grid"
 )
@@ -92,27 +93,27 @@ func findCorners(area map[grid.Point]bool) int {
 }
 
 func findPlantBed(g grid.Grid, visited map[grid.Point]bool, start grid.Point) (map[grid.Point]bool, int) {
-	queue := []grid.Point{start}
-	area := map[grid.Point]bool{}
+	queue := bfs.New(start)
 	perimeter := 0
 
-	for len(queue) > 0 {
-		current := queue[0]
-		queue = queue[1:]
+	for queue.Loop() {
+		current := queue.Pop()
 
 		if _, ok := visited[current]; ok {
 			continue
 		}
 
 		neighbors := getNeighbors(g, current)
 		perimeter += 4 - len(neighbors)
-		area[current] = true
+		queue.Visit(current)
 		visited[current] = true
 
-		queue = append(queue, neighbors...)
+		for _, n := range neighbors {
+			queue.Push(n)
+		}
 	}
 
-	return area, perimeter
+	return queue.Visited, perimeter
 }
 
 func getNeighbors(g grid.Grid, current grid.Point) []grid.Point {

go/2024/puzzles/day15/main.go

@@ -4,6 +4,7 @@ import (
 	"fmt"
 	"strings"
 
+	"github.com/believer/aoc-utils/algorithms/bfs"
 	"github.com/believer/aoc-utils/files"
 	"github.com/believer/aoc-utils/grid"
 )
@@ -95,12 +96,11 @@ func part2(name string) int {
 	// Use BFS to find boxes
 moves:
 	for _, m := range moves {
-		queue := []grid.Point{robot}
+		queue := bfs.New(robot)
 		boxes := map[grid.Point]byte{}
 
-		for len(queue) > 0 {
-			current := queue[0]
-			queue = queue[1:]
+		for queue.Loop() {
+			current := queue.Pop()
 
 			if _, ok := boxes[current]; ok {
 				continue
@@ -114,11 +114,11 @@ moves:
 			case '#':
 				continue moves
 			case ']':
-				queue = append(queue, next.Add(grid.LEFT))
-				queue = append(queue, next)
+				queue.Push(next.Add(grid.LEFT))
+				queue.Push(next)
 			case '[':
-				queue = append(queue, next.Add(grid.RIGHT))
-				queue = append(queue, next)
+				queue.Push(next.Add(grid.RIGHT))
+				queue.Push(next)
 			}
 		}