关于矩阵中的节点的问题

如何解决关于矩阵中的节点的问题

我将尝试解释我将在接下来的部分中介绍的所有代码，首先我要告诉你问题，我正在丢失此矩阵中与邻居邻接一个节点的指针的引用，我放一个printf给您，以帮助我了解我失去了什么样的参考，现在我要制作的程序是一个矩阵，其中包含在其属性中具有上，下，左，右邻居的节点，而我试图防止边缘情况在邻居属性中放置空指针，但是我不知道为什么不正确，因为空值突然变为1，我真的不知道为什么。 这是代码：（这是我可以用来显示错误的较小代码）

#include <stdio.h>
#include <unistd.h>
#include <string.h>

typedef struct Node
{
    int id;  
    int col;
    int row;
    int node_restricted; 
    struct Node* up;
    struct Node* down;
    struct Node* left;
    struct Node* right;
    int color;

}Node;
Node init_node(int id,int col,int row){
    Node new_node;
    new_node.id=id;
    new_node.col = col;
    new_node.row = row;
    new_node.up = NULL;
    new_node.down = NULL;
    new_node.left = NULL;
    new_node.right = NULL;
    new_node.color = 0;
    new_node.node_restricted = 0;

    return new_node;
}
Node** form_matrix_with_node(int amount_of_node_axis_x,int amount_of_node_axis_y){

    Node** matrix_with_node = calloc(amount_of_node_axis_x,sizeof(Node*));

    for (int i = 0; i < amount_of_node_axis_x; i++)
    {
        matrix_with_node[i] = calloc(amount_of_node_axis_y,sizeof(Node));
    }
    
    
    int total_of_node = amount_of_node_axis_x*amount_of_node_axis_y;
    int row = 0;
    int col = 0;
    for (int i = 0; i < total_of_node; i++)
    {
        if (((col+1)%amount_of_node_axis_x)==0)
        {
            matrix_with_node[row][col] = init_node(i,row,col);
            row = row + 1; 
            col = 0;
        }else{
            matrix_with_node[row][col] = init_node(i,col);
            col = col + 1;    
        }
        
    }
    
    link_between_node(matrix_with_node,amount_of_node_axis_x,amount_of_node_axis_y);
    matrix_with_node[0][0].color = 1;
    matrix_with_node[0][2].color = 1;
    matrix_with_node[0][3].color = 1;
    printf("this is my left pointer  %d\n",matrix_with_node[1][0].left);
    matrix_with_node[0][4].color = 1;
    printf("this is my left pointer  %d\n",matrix_with_node[1][0].left);
    matrix_with_node[1][0].color = 1;
    matrix_with_node[1][1].color = 1;
    matrix_with_node[1][2].color = 1;
    matrix_with_node[2][0].color = 1;
    matrix_with_node[3][0].color = 2; 
    
    
    

    
    return matrix_with_node;
}

void link_between_node(Node** matrix_with_node,int amount_of_node_axis_x,int amount_of_node_axis_y){
    
    for (int i = 0; i < amount_of_node_axis_x; i++)
    {
        for (int j = 0; j < amount_of_node_axis_y; j++)
        {            
            //en el siguente se ve si la conexion con el nodo de arriba
            if ((i-1)>=0)
            {            
                matrix_with_node[i][j].up = &(matrix_with_node[i-1][j]);
            }//en el siguente se ve si la conexion con el nodo de abajo
            if ((i+1)<amount_of_node_axis_y)
            {                
                matrix_with_node[i][j].down = &(matrix_with_node[i+1][j]);
            }//en el siguente se ve si la conexion con el nodo de izquierda
            if ((j-1)>=0)
            {                
                matrix_with_node[i][j].left = &(matrix_with_node[i][j-1]);
            }//en el siguente se ve si la conexion con el nodo de derecha
            if ((j+1)<amount_of_node_axis_x)
            {
                matrix_with_node[i][j].right = &(matrix_with_node[i][j+1]);
            }
        }      
    }
}
int main(int argc,char** argv)
{
    form_matrix_with_node(4,4);
}