#

Junjie

2025-01-12 84e959cd1b213e0706b884d54903fe6f3dd7079d

 src/main/java/com/zy/common/model/NavigateNode.java

@@ -32,7 +32,7 @@
        this.Father = father;
        if (this.Father != null) {
            //走过的步数等于父节点走过的步数加一
            this.G = father.G + 1;
            this.G = father.G + this.G;
        } else { //父节点为空代表它是第一个结点
            this.G = 0;
        }