php 动态规划解决tsp问题

php大佬们，请教一个问题
最近在看动态规划解决tsp的算法问题
我百度不到php代码 所以根据别的语言翻译出来一个php版的
但是运行会出现问题

文章链接：
https://blog.csdn.net/chigenb/article/details/105747941?utm_medium=distribute.pc_relevant.none-task-blog-BlogCommendFromMachineLearnPai2-3.channel_param&depth_1-utm_source=distribute.pc_relevant.none-task-blog-BlogCommendFromMachineLearnPai2-3.channel_param

<?php
# 文章链接：https://blog.csdn.net/chigenb/article/details/105747941?utm_medium=distribute.pc_relevant.none-task-blog-BlogCommendFromMachineLearnPai2-3.channel_param&depth_1-utm_source=distribute.pc_relevant.none-task-blog-BlogCommendFromMachineLearnPai2-3.channel_param

# 不对

$arr=[
    [-1,25483,18244,18466],
    [20739,-1,2528,2750],
    [20702,5439,-1,356],
    [20513,5350,356,-1],
];
$arr=[
    [-1,3,6,7],
    [5,-1,2,3],
    [6,4,-1,2],
    [3,7,5,-1],
];
$dp=[];
$n = count($arr);
$m = 1;
$rode=[];
# 计算 2^(n-1)
for($i=1;$i<$n;$i++){
    $m = $m*2;
}



# 初始化第0列
for($i=0;$i<$n;$i++){
    $dp[$i][0]  = $arr[$i][0];
}

for($j=1;$j<$m;$j++){
    for($i=1;$i<$n;$i++){
        $dp[$i][$j]=0x7ffff;
        if((($j>>($i-1)) & 1)==1){
            continue;
        }
        for($k=1;$k<$n;$k++){
            if((($j>>($k-1)) & 1)==0){
                continue;
            }

            if($dp[$i][$j] > $arr[$i][$k]+$dp[$k][$j^(1 << ($k-1))]){

                $dp[$i][$j] = $arr[$i][$k]+$dp[$k][$j^(1 << ($k-1))];

                $rode[$i][$j]['x'] = $i;
                $rode[$i][$j]['y'] = $k;
                $rode[$i][$j]['z'] = $j^ (1 << ($k-1));
            }
        }
    }
}
for($j=0;$j<$m-1;$j++){
    $dp[0][$j] = -1;
}
$dp[0][$m-1] = 0x7ffff;
for($k=1;$k<$n;$k++){
    if ((( $m-1 >> ($k - 1)) & 1 ) == 0)
        continue;

    if ($dp[0][$m - 1] > $arr[0][$k] + $dp[$k][($m - 1) ^ (1 << ($k - 1))])
    {
        $dp[0][$m - 1] = $arr[0][$k] + $dp[$k][($m - 1) ^ (1 << ($k - 1))];
        $rode[0][$m - 1]['x'] = 0;
        $rode[0][$m - 1]['y'] = $k;
        $rode[0][$m - 1]['z'] = ($m - 1) ^ (1 << ($k - 1));
    }
}
echo "最短路程为：".$dp[0][$m-1].PHP_EOL;
$j = $m-1;
$str = "0→";
for($i=0;$i<$n-1;$i++){
    $str.=$rode[$i][$j]['y'].'→';
    $j = $rode[$i][$j]['z'];
}
$str.=$rode[$i][$j]['y']??0;
echo "路线为：".$str.PHP_EOL;


print_r($rode);

运行我的数据结果是不对的！！！