algorithm/JavaScript
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/JavaScript.git synced 2025-07-06 09:28:26 +08:00
Code Issues Packages Projects Releases Wiki Activity

Added JS standard

Browse Source
This commit is contained in:
Rodrigo
2021-01-06 17:37:19 -03:00
parent 5946f987a9
commit 7b15f66a86
1 changed files with 7 additions and 8 deletions
Download Patch File Download Diff File Expand all files Collapse all files

7
Graphs/NodeNeighbors.js
View File

@ -16,14 +16,13 @@ class Graph{
nodeNeighbors (node) { nodeNeighbors (node) {
// Returns an array with all of the node neighbors // Returns an array with all of the node neighbors
let neighbors = [] const neighbors = []
for (let i = 0; i < this.edges.length; i++) { for (let i = 0; i < this.edges.length; i++) {
// Checks if they have an edge between them and if the neighbor is not // Checks if they have an edge between them and if the neighbor is not
// already in the neighbors array // already in the neighbors array
if (this.edges[i].node1 === node && !(neighbors.includes(this.edges[i].node2))) { if (this.edges[i].node1 === node && !(neighbors.includes(this.edges[i].node2))) {
neighbors.push(this.edges[i].node2) neighbors.push(this.edges[i].node2)
} } else if (this.edges[i].node2 === node && !(neighbors.includes(this.edges[i].node1))) {
else if (this.edges[i].node2 === node && !(neighbors.includes(this.edges[i].node1))) {
neighbors.push(this.edges[i].node1) neighbors.push(this.edges[i].node1)
} }
} }
@ -32,7 +31,7 @@ class Graph{
} }
(() => { (() => {
let graph = new Graph() const graph = new Graph()
graph.addEdge(1, 2) graph.addEdge(1, 2)
graph.addEdge(2, 3) graph.addEdge(2, 3)
graph.addEdge(3, 5) graph.addEdge(3, 5)