GV

GeezerVison

The World Wide Web, restored to 800 pixels of glory.

Home|About|Gaming cabinet|Archives|How it works|Starter sites

On this site

  • Sign in
  • ActionsCI/CD and automation
  • CodespacesCloud development environments
  • All Features
  • Documentation
  • Training
  • Certifications
  • Build with Copilot
  • Customize Copilot
  • Integrations
  • Trending repos
  • GitHub Sponsors
  • Developer articles
  • Enterprises

This view

  • Original page
  • New address

GeezerVison is showing github.com — JavaScript/Graphs/DepthFirstSearchIterative.js at master · TheAlgorithms/JavaScript

Expand file tree

/

DepthFirstSearchIterative.js

Copy path
More file actions
More file actions

Latest commit

 

History

History
History
57 lines (51 loc) · 1.49 KB
/

DepthFirstSearchIterative.js

Copy path

File metadata and controls

57 lines (51 loc) · 1.49 KB
Raw
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
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
53
54
55
56
57
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)
}
DFSIterative(node, value) {
// DFS Function to search if a node with the given value is present in the graph
const stack = [node]
const visited = new Set()
while (stack.length > 0) {
const currNode = stack.pop()
// if the current node contains the value being searched for, true is returned
if (currNode === value) {
return true
}
// adding the current node to the visited set
visited.add(currNode)
// adding neighbours in the stack
for (const neighbour of this.connections[currNode]) {
if (!visited.has(neighbour)) {
stack.push(neighbour)
}
}
}
return false
}
}
export { GraphUnweightedUndirected }
// Example
// const graph = new GraphUnweightedUndirected()
// graph.addEdge(1, 2)
// graph.addEdge(2, 3)
// graph.addEdge(2, 4)
// graph.addEdge(3, 5)
// graph.DFSIterative(5, 1)
// graph.DFSIterative(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.