【数据结构】求多出口迷宫的最短路径（递归版本）

Maze.h

#pragma once

#include<stdio.h>

typedef struct Pos{
	int _Row;
	int _COL;
}Pos;



typedef struct Maze{

	struct Pos pos;

}Maze;

Maze.c

#define _CRT_SECURE_NO_WARNINGS 1
#include<stdlib.h>
#include"Maze.h"
#include"Stack.h"

int Canstay(Pos* pos) {

	if (pos == NULL) {
		return;
	}
	if (pos->_Row < 0 || pos->_COL < 0 ||
		pos->_Row > 6 || pos->_COL > 6) {
		/*当前pos在地图外面*/
		return 0;
	}
	return 1;
}

/*是否可以形成通路*/
int CanWalk(Pos* pos, int Map[7][7]) {

	if (pos == NULL) {
		return;
	}
	if (Map[pos->_Row][pos->_COL] == 1) {
		/*当前点可以走*/
		return 1;
	}
	return 0;
}

void MarkPos(Pos* pos, int Map[7][7]) {
	if (pos == NULL) {
		return;
	}
	Map[pos->_Row][pos->_COL] = 2;
}

int CheckExport(Pos* pos, int Map[7][7]) {
	if (pos == NULL) {
		re