Grids and Graphs

The `grid` keyword parses a multi-line string into a 2D grid, mapping characters to values. Use `_` as a wildcard.

let g = grid "##.\n#..\n..."
	"#" => 1
	_ => 0

print g[0]
print g[1]
print g[2]

Access grid cells with `g[row, col]` or get a full row with `g[row]`. Use `width` and `height` to get dimensions.

let g = grid "abc\ndef\nghi"
	c => c

print "Size: {width g}x{height g}"
print "Center: {g[1, 1]}"

`flood_fill` finds all connected cells from a starting point. Provide a `walkable` predicate to control which cells can be traversed.

let g = grid "..##\n..#.\n....\n.##."
	"#" => 1
	_ => 0

flood_fill({ grid: g, start: [0, 2], walkable: ? == 1 })
	| len
	| print

`bfs` performs breadth-first search given a start, goal, and neighbors function. It returns the shortest path.

-- Find shortest path from 0 to 10
-- where each step can add 1 or multiply by 2
bfs({ start: 0, goal: 10, neighbors: x -> [x + 1, x * 2] })
	| print