go语言实现利用广度优先搜索算法实现走迷宫

package main

import (
	"fmt"
	"os"
)

//读取maze的函数
func readMaze(filename string) [][]int {
	file, err := os.Open(filename)
	if err != nil {
		panic(err)
	}

	var row, col int
	fmt.Fscanf(file, "%d %d", &row, &col) //读出的数赋给row和col
	fmt.Fscanf(file, "%d")

	maze := make([][]int, row)
	for i := range maze {
		maze[i] = make([]int, col)
		for j := range maze[i] {
			fmt.Fscanf(file, "%d", &maze[i][j])
		}
		fmt.Fscanf(file, "%d")
	}

	return maze
}

//定义一个点的结构体
type point struct {
	i, j int
}

//定义方向，按照上左下右
var dirs = [4]point{{-1, 0}, {0, -1}, {1, 0}, {0, 1}}

//实现了点的坐标的加法
func (p point) add(r point) point {
	return point{p.i + r.i, p.j + r.j}
}

//实现grid中坐标为p的值
func (p point) at(grid [][]int) (int, bool) {
	if p.i < 0 || p.i >= len(grid) {
		return 0, false
	}

	if p.j < 0 || p.j >= len(grid[0]) {
		return 0, false
	}

	return grid[p.i][p.j], true
}

//走迷宫的函数
func walk(maze [][]int, start, end point) [][]int {
	steps := make([][]int, len(maze))
	for i := range steps {
		steps[i] = make([]int, len(maze[i]))
	}

	Q := []point{start}

	for len(Q) > 0 {
		cur := Q[0]
		Q = Q[1:]
		if cur == end {
			break
		}
		for _, dir := range dirs {
			next := cur.add(dir)

			//当maze中的next坐标为0
			//并且steps中的next坐标也为0的时候才能走，因为走过的地方不能再走了
			//并且也不能走回起点，所以next！=start

			val, ok := next.at(maze)
			if !ok || val == 1 { //假如越界了，或者是下一个点为1
				continue
			}

			val, ok = next.at(steps)
			if !ok || val != 0 { //如果steps越界了，下一个位置不是0
				continue
			}
			if next == start { //如果下一个是七起点
				continue
			}

			curSteps, _ := cur.at(steps)
			steps[next.i][next.j] = curSteps + 1

			Q = append(Q, next)

		}

	}

	return steps

}

func main() {
	//读取maze
	maze := readMaze("maze/maze.in")
	//for _, row := range maze {
	//	for _, val := range row {
	//		fmt.Printf("%d ", val)
	//	}
	//	fmt.Println()
	//}

	//走迷宫
	steps := walk(maze, point{0, 0}, point{len(maze) - 1, len(maze[0]) - 1})

	start := point{0, 0}
	end := point{len(maze) - 1, len(maze[0]) - 1}
	fmt.Println("steps为：")
	for _, row := range steps {
		for _, val := range row {
			fmt.Printf("%3d", val)
		}
		fmt.Println()
	}

	fmt.Println("走完迷宫最步数：")
	step, _ := end.at(steps)
	fmt.Println(step)
	fmt.Println("路径为：")
	route := []point{end}
	cur := end
	for cur != start {
		for _, dir := range dirs {
			next := cur.add(dir)
			val, ok := next.at(steps)
			curVal, _ := cur.at(steps)
			if ok && val == curVal-1 {
				route = append(route, next)
				cur = next
			}
		}
	}

	for i := len(route) - 1; i >= 0; i-- {
		fmt.Printf("(%d,%d)", route[i].i, route[i].j)
		if i > 0 {
			fmt.Print("-->")
		}
	}

}