We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 29c0dd4 commit 84d7e21Copy full SHA for 84d7e21
src/common/lindenmayer.js
@@ -17,7 +17,7 @@ const shortestPath = (nodes) => {
17
if (visited[edge12Key]) {
18
const result = nearestUnvisitedNode(i + 1, nodes, visited, graph)
19
20
- if (unvisitedNode != null) {
+ if (result != null) {
21
const shortestSubPath = graph.bfsShortestPath(
22
node1Key,
23
result.node.toString(),
0 commit comments