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/DepthFirstSearchRecursive.js at master · TheAlgorithms/JavaScript Expand file tree/ Copy pathDepthFirstSearchRecursive.jsMore file actions 52 lines (47 loc) · 1.41 KB / Copy pathDepthFirstSearchRecursive.jsFile metadata and controls52 lines (47 loc) · 1.41 KB 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 41 42 43 44 45 46 47 48 49 50 51 52 class GraphUnweightedUndirected { // Unweighted Undirected Graph class constructor() { this.connections = {} } addNode(node) { // Function to add a node to the graph (connection represented by set) this.connections[node] = new Set() } addEdge(node1, node2) { // Function to add an edge (adds the node too if they are not present in the graph) if (!(node1 in this.connections)) { this.addNode(node1) } if (!(node2 in this.connections)) { this.addNode(node2) } this.connections[node1].add(node2) this.connections[node2].add(node1) } DFSRecursive(node, value, visited = new Set()) { // DFS Function to search if a node with the given value is present in the graph // checking if the searching node has been found if (node === value) { return true } // adding the current node to the visited set visited.add(node) // calling the helper function recursively for all unvisited nodes for (const neighbour of this.connections[node]) { if (!visited.has(neighbour)) { if (this.DFSRecursive(neighbour, value, visited)) { return true } } } return false } } export { GraphUnweightedUndirected } // const graph = new GraphUnweightedUndirected() // graph.addEdge(1, 2) // graph.addEdge(2, 3) // graph.addEdge(2, 4) // graph.addEdge(3, 5) // graph.DFSRecursive(5, 1) // graph.DFSRecursive(5, 100) |
| You are visitor 01402503 — 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. |