mirror of
https://gitee.com/yyz_o/bk_bishe_pi.git
synced 2025-09-07 23:21:26 +00:00
54 lines
2.3 KiB
C++
54 lines
2.3 KiB
C++
#include<iostream>
|
||
#include<string>
|
||
#include<vector>
|
||
#include"eyebot++.h"
|
||
#include"maze_parameter.h"
|
||
#include"maze_func.h"
|
||
using namespace std;
|
||
|
||
|
||
/*---下面是主函数---*/
|
||
int main()
|
||
{
|
||
explore(); //使用递归算法构建地图
|
||
BOTturn(2 - rob_dir);
|
||
VWWait();
|
||
rob_dir = 2;
|
||
explore();
|
||
|
||
const int mazesize_x = mark.size(); //获取探索结束之后的迷宫的X轴长度
|
||
const int mazesize_y = mark[0].size(); //获取探索结束之后的迷宫的Y轴长度
|
||
|
||
int copy_mark[mazesize_x * mazesize_y] = {}; //复制一份mark数组，并转换为一维数组，便于后续频繁读取提升性能并初始化为0
|
||
int copy_wall[(mazesize_x + 1) * (mazesize_y + 1) * 2] = {}; //复制一份wall数组，并转换为一维数组，便于后续频繁读取提升性能并初始化为0
|
||
|
||
array_copy_mark(mazesize_x, mazesize_y, copy_mark); //复制一份mark数组，并转换为一维数组，便于后续频繁读取提升性能
|
||
array_copy_wall(mazesize_x, mazesize_y, copy_wall); //复制一份wall数组，并转换为一维数组，便于后续频繁读取提升性能
|
||
|
||
cout << "访问数组打印：" << endl;
|
||
output_arr2D(mazesize_x, mazesize_y, copy_mark); //打印地图mark信息
|
||
cout << "地图打印：" << endl;
|
||
output_arrwall(mazesize_x, mazesize_y, copy_wall); //打印墙壁wall信息
|
||
|
||
cout << "请输入目标点的X,Y坐标值 用空格隔开并回车" << endl;
|
||
cin >> target_x >> target_y;
|
||
cout << endl;
|
||
|
||
int map[mazesize_x * mazesize_y] = {}; //创建最短路径求解地图并初始化为0
|
||
array_negative_one(mazesize_x * mazesize_y, map); //将map数组初始化为-1
|
||
|
||
flood(map, copy_wall); //洪水填充算法
|
||
cout << "路径打印：" << endl;
|
||
output_arr2D(mazesize_x, mazesize_y, map); //打印map的数组信息
|
||
|
||
const int len = map[((target_x - 1) * mazesize_y) + (target_y -1)]; //迷宫的终点（人为确定）
|
||
int path[len] = {}; //创建最短路径结果地图并初始化为0
|
||
|
||
build_path(target_x - 1, target_y - 1, len, path, map, copy_wall); //构建出最短路径path数组
|
||
|
||
cout << "移动指令打印：" << endl;
|
||
output_arrpath(len, path); //打印path数组信息，及小车每一步的行驶方向
|
||
|
||
drive_path(len, path); //移动到指定目标点
|
||
}
|