查找二元矩阵上的任意路径

Question

我正在尝试编写一个C程序，该C程序遵循左右的1秒打印1s的水平移动2s的1s。它不必是最短的路径或计算每个路径。我试图递归地写下它非常新。

char check_path(char *table,int current_row,int current_col);
int current_row=0,current_col=0;

int main()
{
    int i,j,row,col,current_row,current_col;
    char table[30][30];
    
    printf("Matrisin satir sayisini giriniz : ");
    scanf("%d",&row);
    printf("Matrisin sutun sayisini giriniz : ");
    scanf("%d",&col);
    

    
    for(i=0;i<row;i++){
        for(j=0;j<col;j++){
            printf("1 ya da 0 olacak sekilde %d. satir ve %d. sutundaki elemani giriniz : ",i+1,j+1);
            scanf("%d",&table[i][j]);
        }
    }
    
    check_path(table,0,0);
    
    for (i = 0; i < row; i++)
    {
        for (j = 0; j < col; j++)
        {
            printf("%d\t", table[i][j]);
        }
        printf("\n");
    }
    
    return 0;
    
}

char check_path(char *table,int current_row,int current_col)
{
    if (*(*(table+current_row)+current_col+1) != 0)
    {
        *(*(table+current_row)+current_col+1) = '-';
        printf("1\t");
        return check_path(table,current_row,current_col+1);
        
    }

    else
    {   
        current_col=0;
        printf("2\t");
        return check_path(table,current_row+1,current_col);

    }
}