布线问题C

#include <stdio.h>
#include <stdlib.h>

// 定义二维网格的大小
#define ROWS 8
#define COLS 8

// 定义方向数组，用于上下左右移动
int directions[4][2] = {{-1, 0}, {1, 0}, {0, -1}, {0, 1}};

// 定义点结构体
typedef struct {
    int x;
    int y;
} Point;

// 检查点是否在网格范围内且不是障碍物
int is_valid(int x, int y, int grid[ROWS][COLS]) {
    return (x > 0 && x <= ROWS && y > 0 && y <= COLS && grid[x-1][y-1] == 0);
}

// BFS算法求解最短路径
int bfs(Point start, Point end, int grid[ROWS][COLS], Point parent[ROWS][COLS]) {
    // 初始化队列
    Point queue[ROWS * COLS];
    int front = 0, rear = 0;
    
    // 将起点加入队列
    queue[rear++] = start;
    grid[start.x-1][start.y-1] = 1; // 标记起点为已访问
    
    // BFS过程
    while (front < rear) {
        Point current = queue[front++];
        
        // 检查是否到达终点
        if (current.x == end.x && current.y == end.y) {
            return 1; // 找到路径
        }
        
        // 遍历四个方向
        for (int i = 0; i < 4; i++) {
            int new_x = current.x + directions[i][0];
            int new_y = current.y + directions[i][1];
            
            if (is_valid(new_x, new_y, grid)) {
                queue[rear++] = (Point){new_x, new_y};
                grid[new_x-1][new_y-1] = 1; // 标记为已访问
                parent[new_x-1][new_y-1] = current; // 记录父节点
            }
        }
    }
    
    return 0; // 未找到路径
}

// 回溯路径并输出
void print_path(Point start, Point end, Point parent[ROWS][COLS]) {
    Point path[ROWS * COLS];
    int path_length = 0;
    Point current = end;
    
    // 从终点回溯到起点
    while (!(current.x == start.x && current.y == start.y)) {
        path[path_length++] = current;
        current = parent[current.x-1][current.y-1];
    }
    path[path_length++] = start; // 加入起点
    
    // 输出路径
    printf("%d\n", path_length - 1); // 输出路径长度
    for (int i = path_length-2; i >= 0; i--) {
        printf("(%d,%d) ", path[i].x, path[i].y);
    }
    //printf("\n");
    //printf("(%d %d)",path[9].x, path[9].y);
    
}

int main() {
    // 初始化网格，0表示空地，1表示障碍物
    int grid[ROWS][COLS] = {0};
    int obstacles[][2] = {
        {1, 3}, {2, 3}, {2, 4}, {3, 5}, {4, 4}, {4, 5}, {5, 1}, {5, 5}, {6, 1}, {6, 2}, {6, 3}, {7, 1}, {7, 2}, {7, 3}
    };
    
    // 设置障碍物
    for (int i = 0; i < sizeof(obstacles) / sizeof(obstacles[0]); i++) {
        grid[obstacles[i][0]-1][obstacles[i][1]-1] = 1;
    }
    
    Point start = {3, 2};
    Point end = {4, 6};
    
    Point parent[ROWS][COLS]; // 用于记录每个点的父节点
    
    // 执行BFS，找到路径并记录每个点的父节点
    if (bfs(start, end, grid, parent)) {
        print_path(start, end, parent); // 输出路径和路径长度
    } else {
        printf("Path not found.\n");
    }
    
    return 0;
}