RexKizzy22
/ pathfinder.go
Last active
February 20, 2024 14:47
The pathfinder solution code for my article Demystifying Recursion - Part 2
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| type Point struct { | |
| x int | |
| y int | |
| } | |
| type Path = []Point | |
| func findPath(maze []string, wall string, start Point, end Point) Path { | |
| adjacents := [][]int{[]int{0, 1}, []int{1, 0}, []int{0, -1}, []int{-1, 0}} | |
| seen := [][]bool{} |