2020-07-19 10:22:10 +05:30
|
|
|
class GraphUnweightedUndirected {
|
|
|
|
|
// Unweighted Undirected Graph class
|
2023-10-03 23:08:19 +02:00
|
|
|
constructor() {
|
2020-07-19 10:22:10 +05:30
|
|
|
this.connections = {}
|
|
|
|
|
}
|
|
|
|
|
|
2023-10-03 23:08:19 +02:00
|
|
|
addNode(node) {
|
2020-07-19 10:22:10 +05:30
|
|
|
// Function to add a node to the graph (connection represented by set)
|
|
|
|
|
this.connections[node] = new Set()
|
|
|
|
|
}
|
|
|
|
|
|
2023-10-03 23:08:19 +02:00
|
|
|
addEdge(node1, node2) {
|
2020-07-19 10:22:10 +05:30
|
|
|
// Function to add an edge (adds the node too if they are not present in the graph)
|
2023-10-03 23:08:19 +02:00
|
|
|
if (!(node1 in this.connections)) {
|
|
|
|
|
this.addNode(node1)
|
|
|
|
|
}
|
|
|
|
|
if (!(node2 in this.connections)) {
|
|
|
|
|
this.addNode(node2)
|
|
|
|
|
}
|
2020-07-19 10:22:10 +05:30
|
|
|
this.connections[node1].add(node2)
|
|
|
|
|
this.connections[node2].add(node1)
|
|
|
|
|
}
|
|
|
|
|
|
2023-10-03 23:08:19 +02:00
|
|
|
DFSIterative(node, value) {
|
2020-07-19 10:22:10 +05:30
|
|
|
// 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
|
2023-10-03 23:08:19 +02:00
|
|
|
if (currNode === value) {
|
|
|
|
|
return true
|
|
|
|
|
}
|
2020-07-19 10:22:10 +05:30
|
|
|
// 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
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
2021-10-10 17:55:08 +02:00
|
|
|
export { GraphUnweightedUndirected }
|
|
|
|
|
|
|
|
|
|
// Example
|
2020-07-19 10:22:10 +05:30
|
|
|
|
2021-10-10 17:55:08 +02:00
|
|
|
// 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)
|
