GeezerVisonThe World Wide Web, restored to 800 pixels of glory. |
| Home|About|Gaming cabinet|Archives|How it works|Starter sites |
GeezerVison is showing github.com — JavaScript/Graphs/NodeNeighbors.js at master · hackingstaar/JavaScript Expand file tree/ Copy pathNodeNeighbors.jsMore file actions 40 lines (35 loc) · 985 Bytes / Copy pathNodeNeighbors.jsFile metadata and controls40 lines (35 loc) · 985 Bytes 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 // https://en.wikipedia.org/wiki/Neighbourhood_(graph_theory) class Graph { // Generic graph: the algorithm works regardless of direction or weight constructor() { this.edges = [] } addEdge(node1, node2) { // Adding edges to the graph this.edges.push({ node1, node2 }) } nodeNeighbors(node) { // Returns an array with all of the node neighbors const neighbors = new Set() for (const edge of this.edges) { // Checks if they have an edge between them and if the neighbor is not // already in the neighbors array 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 } } export { Graph } // const graph = new Graph() // graph.addEdge(1, 2) // graph.addEdge(2, 3) // graph.addEdge(3, 5) // graph.addEdge(1, 5) // graph.nodeNeighbors(1) |
| You are visitor 01402520 — GeezerVison does not store the pages you look up. Best viewed with Netscape Navigator 4.7 or Internet Explorer 6 at 800×600. No cookies required. |