Javascript 图与邻接表实践
嘿,伙计们,我目前正在研究一个涉及图和邻接列表的问题,但它不起作用。这只是为了自学,不是为了上学或做作业。 我得到了以下价值表:Javascript 图与邻接表实践,javascript,data-structures,Javascript,Data Structures,嘿,伙计们,我目前正在研究一个涉及图和邻接列表的问题,但它不起作用。这只是为了自学,不是为了上学或做作业。 我得到了以下价值表: | Start name | End name | Example path found by a search | |------------|----------|-----------------------------------| | carrie | carrie | carrie (it's the same node) |
| Start name | End name | Example path found by a search |
|------------|----------|-----------------------------------|
| carrie | carrie | carrie (it's the same node) |
| carrie | humza | carrie -> humza |
| carrie | yervand | carrie -> jun -> silla -> yervand |
| ophelia | ursula | ophelia -> travis -> **FAIL** |
| travis | carrie | travis -> ophelia -> **FAIL** |
| ursula | ophelia | ursula -> travis -> ophelia |
| victor | humza | victor -> **FAIL** |
但我的代码不起作用,它说我不明白这一点:
if (!adjacencyList[startName]) return null;
const queue = [startName];
let visited = new Set();
let currentVertex;
if (adjacencyList[startName] === adjacencyList[endName]) return adjacencyList[startName]
while(queue.length) {
currentVertex = queue.shift();
if (!visited.has(currentVertex)) {
visited.add(currentVertex);
adjacencyList[currentVertex].forEach(neighbor => queue.push(neighbor))
}
}
if (visited.has(endName)) {
return visited;
}
else {
return null
}
}
Idk问题是什么以及如何解决。我想通过返回布景,我会返回路径,但显然不是。顺便说一句,这里提供了一个邻接列表:“嘉莉”:['humza','jun'],'farrah':['humza','humza'],'humza':['carrie','farrah','jun','silla','jun':['carrie','silla','ophelia:['travis','silla':['humza','yervand','travis:这是我应该得到的{startName':'carrie','endName':'carrie','victor':['travis'],'victor':[],'yervand':['silla']这是我应该得到的{'startName':'carrie','visited':['carrie'],{'startName':'carrie','endName':'humza','humza',{'startName':'carrie','endName':'yervand','visted':['carrie','jun','farrah','yervand','humza','silla']},