algorithm/JavaScript
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/JavaScript.git synced 2025-07-04 15:39:42 +08:00
Code Issues Packages Projects Releases Wiki Activity

Added suggestions and updated for loop

Browse Source
This commit is contained in:
rodigu
2021-01-18 20:54:44 -03:00
parent 1d72cbb273
commit 686ba7e8f9
1 changed files with 5 additions and 5 deletions
Download Patch File Download Diff File Expand all files Collapse all files

10
Graphs/NodeNeighbors.js
View File

@ -17,13 +17,13 @@ class Graph {
nodeNeighbors (node) {
// Returns an array with all of the node neighbors
const neighbors = new Set()
for (let i = 0; i < this.edges.length; i++) {
for (let edge of this.edges) {
// Checks if they have an edge between them and if the neighbor is not
// already in the neighbors array
if (this.edges[i].node1 === node && !(neighbors.includes(this.edges[i].node2))) {
neighbors.push(this.edges[i].node2)
} else if (this.edges[i].node2 === node && !(neighbors.includes(this.edges[i].node1))) {
neighbors.push(this.edges[i].node1)
if (edge.node1 === node && !(neighbors.has(edge.node2))) {
neighbors.add(edge.node2)
} else if (edge.node2 === node && !(neighbors.has(edge.node1))) {
neighbors.add(edge.node1)
}
}
return neighbors