lostecho/grokking_algorithms
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Fix: dijkstras example for JavaScript ES6. (#205)

Browse Source
This commit is contained in:
Vasilii Boldurean
2022-11-18 21:28:46 +00:00
committed by GitHub
parent c91f1ad37f
commit 38f962f2a3
1 changed files with 2 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
07_dijkstras_algorithm/ES6/01_dijkstras_algorithm.js
View File

@@ -39,7 +39,7 @@ const findLowestCostNode = itCosts => {
Object.keys(itCosts).forEach(node => { Object.keys(itCosts).forEach(node => {
const cost = itCosts[node]; const cost = itCosts[node];
// If it's the lowest cost so far and hasn't been processed yet... // If it's the lowest cost so far and hasn't been processed yet...
if (cost < lowestCost && processed.indexOf(node) === -1) { if (cost < lowestCost && !processed.includes(node)) {
// ... set it as the new lowest-cost node. // ... set it as the new lowest-cost node.
lowestCost = cost; lowestCost = cost;
lowestCostNode = node; lowestCostNode = node;
@@ -66,7 +66,7 @@ while (node !== null) {
}); });
// Mark the node as processed // Mark the node as processed
processed = processed.concat(node); processed.push(node);
// Find the next node to process, and loop // Find the next node to process, and loop
node = findLowestCostNode(costs); node = findLowestCostNode(costs);