# Depth-First Search implementation in Node.js

Medium

8

1

21.1% Acceptance

In this lab, you will implement the **Depth-First Search(Graph)** algorithm using Node.js. Depth-First Search (DFS) is an algorithm that traverses the nodes of a graph by going as far as possible along each branch before backtracking. To achieve this, you will create a Graph class and implement a DFS method. The graph is represented using an adjacency list. The DFS function should return an array containing the visited nodes.