FilesExpand file tree

 master

/

DepthFirstSearchIterative.js

Copy path

BlameMore file actions

BlameMore file actions

Latest commit

 

History

History

History

51 lines (45 loc) · 1.46 KB

 master

/

DepthFirstSearchIterative.js

Top

File metadata and controls

• Code
• Blame

51 lines (45 loc) · 1.46 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

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)