onyx_online/aoc2024
1
0
Fork 0
mirror of https://github.com/onyx-and-iris/aoc2024.git synced 2025-04-04 12:13:46 +01:00
Code Issues Actions Packages Projects Releases Wiki Activity

Compare commits

base: onyx_online:cdca21b3f3fe57a06850e88da228c5369c5e8d28
Branches Tags
onyx_online:main
...
compare: onyx_online:5a6947af2ce94befb98892c8a0baa7227f068e05
Branches Tags
onyx_online:main

2 Commits
cdca21b3f3 ... 5a6947af2c

Author SHA1 Message Date
onyx-and-iris
5a6947af2c move enqueue(ns[dir]) into loop 2024-12-25 21:01:35 +00:00
onyx-and-iris
33ee076cf1 refactor switch-case 2024-12-25 15:59:52 +00:00
1 changed files with 26 additions and 48 deletions
Show Stats Expand all files Collapse all files

74
day-15/internal/two/explore.go
View File

@ -6,24 +6,24 @@ import (
orderedmap "github.com/wk8/go-ordered-map/v2"
)
func exploreDFS(graph *graph, next point, direction direction, stack *stack) (*stack, bool) {
func exploreDFS(graph *graph, next point, dir direction, stack *stack) (*stack, bool) {
ns := neighbours(next)
log.Debug(string(graph.valueAt(ns[direction])))
log.Debug(string(graph.valueAt(ns[dir])))
switch graph.valueAt(ns[direction]) {
switch graph.valueAt(ns[dir]) {
case '#':
return nil, false
case '.':
return stack, true
case '[', ']':
stack.Push(ns[direction])
stack.Push(ns[dir])
}
return exploreDFS(graph, ns[direction], direction, stack)
return exploreDFS(graph, ns[dir], dir, stack)
}
func exploreBFS(graph *graph, direction direction) (*orderedmap.OrderedMap[point, struct{}], bool) {
func exploreBFS(graph *graph, dir direction) (*orderedmap.OrderedMap[point, struct{}], bool) {
queue := newQueue()
queue.Enqueue(graph.robot)
visited := make(map[point]struct{})
@ -39,60 +39,38 @@ func exploreBFS(graph *graph, direction direction) (*orderedmap.OrderedMap[point
visited[current] = struct{}{}
ns := neighbours(current)
switch graph.valueAt(ns[direction]) {
switch graph.valueAt(ns[dir]) {
case '.':
if graph.valueAt(current) == '@' {
return om, true
}
case '#':
return om, false
case '[':
log.Debugf("adding %s to the queue", string(graph.valueAt(ns[direction])))
queue.Enqueue(ns[direction])
_, ok := om.Get(ns[direction])
if !ok {
om.Set(ns[direction], struct{}{})
}
case '[', ']':
nextDirections := []direction{dir}
switch direction {
case N:
log.Debugf("adding %s to the queue", string(graph.valueAt(ns[NE])))
queue.Enqueue(ns[NE])
_, ok := om.Get(ns[NE])
if !ok {
om.Set(ns[NE], struct{}{})
if graph.valueAt(ns[dir]) == '[' {
switch dir {
case N:
nextDirections = append(nextDirections, NE)
case S:
nextDirections = append(nextDirections, SE)
}
case S:
log.Debugf("adding %s to the queue", string(graph.valueAt(ns[SE])))
queue.Enqueue(ns[SE])
_, ok := om.Get(ns[SE])
if !ok {
om.Set(ns[SE], struct{}{})
} else if graph.valueAt(ns[dir]) == ']' {
switch dir {
case N:
nextDirections = append(nextDirections, NW)
case S:
nextDirections = append(nextDirections, SW)
}
}
case ']':
log.Debugf("adding %s to the queue", string(graph.valueAt(ns[direction])))
queue.Enqueue(ns[direction])
_, ok := om.Get(ns[direction])
if !ok {
om.Set(ns[direction], struct{}{})
}
switch direction {
case N:
log.Debugf("adding %s to the queue", string(graph.valueAt(ns[NW])))
queue.Enqueue(ns[NW])
_, ok := om.Get(ns[NW])
for _, nextDirection := range nextDirections {
log.Debugf("adding %s to the queue", string(graph.valueAt(ns[nextDirection])))
queue.Enqueue(ns[nextDirection])
_, ok := om.Get(ns[nextDirection])
if !ok {
om.Set(ns[NW], struct{}{})
}
case S:
log.Debugf("adding %s to the queue", string(graph.valueAt(ns[SW])))
queue.Enqueue(ns[SW])
_, ok := om.Get(ns[SW])
if !ok {
om.Set(ns[SW], struct{}{})
om.Set(ns[nextDirection], struct{}{})
}
}
}