|
|
@@ -160,7 +160,7 @@ export const useGraphStore = defineStore('graph', () => {
|
|
|
console.log('直接相遇节点数:', meetingNodes.size)
|
|
|
|
|
|
// ========== 如果没有直接相遇,在人设图谱中扩展 ==========
|
|
|
- const maxMiddleSteps = postWalkConfig.maxSteps - 2 // 减去首尾两步
|
|
|
+ const maxMiddleSteps = postWalkConfig.maxSteps // 中间扩展步数
|
|
|
let currentForward = new Set(forwardFrontier)
|
|
|
let currentBackward = new Set(backwardFrontier)
|
|
|
|
|
|
@@ -175,7 +175,7 @@ export const useGraphStore = defineStore('graph', () => {
|
|
|
backwardPaths.set(nodeId, backwardNodes.get(nodeId).map(b => b.edge))
|
|
|
}
|
|
|
|
|
|
- for (let step = 0; step < maxMiddleSteps && meetingNodes.size === 0; step++) {
|
|
|
+ for (let step = 0; step < maxMiddleSteps; step++) {
|
|
|
// 扩展正向(在人设图谱中)
|
|
|
const nextForward = new Set()
|
|
|
const newForwardPaths = new Map()
|
|
|
@@ -208,9 +208,10 @@ export const useGraphStore = defineStore('graph', () => {
|
|
|
forwardPaths.set(k, v)
|
|
|
}
|
|
|
currentForward = nextForward
|
|
|
- console.log(`正向扩展第${step + 1}步,新增节点:`, nextForward.size)
|
|
|
+ console.log(`正向扩展第${step + 1}步,新增节点:`, nextForward.size, '相遇节点:', meetingNodes.size)
|
|
|
|
|
|
- if (meetingNodes.size > 0) break
|
|
|
+ // 如果没有新节点可扩展,提前退出
|
|
|
+ if (nextForward.size === 0) break
|
|
|
}
|
|
|
|
|
|
console.log('最终相遇节点数:', meetingNodes.size)
|