diff --git a/ClassicalAlgos/BFS_algorithm/breadthFirstSearch.js b/ClassicalAlgos/BFS_algorithm/breadthFirstSearch.js
new file mode 100644
index 0000000..0b28ab2
--- /dev/null
+++ b/ClassicalAlgos/BFS_algorithm/breadthFirstSearch.js
@@ -0,0 +1,27 @@
+BFS(node) {
+   // Create a Queue and add our initial node in it
+   let q = new Queue(this.nodes.length);
+   let explored = new Set();
+   q.enqueue(node);
+
+   // Mark the first node as explored explored.
+   add(node);
+
+   // We'll continue till our queue gets empty
+   while (!q.isEmpty()) {
+      let t = q.dequeue();
+
+      // Log every element that comes out of the Queue
+      console.log(t);
+
+      // 1. In the edges object, we search for nodes this node is directly connected to.
+      // 2. We filter out the nodes that have already been explored.
+      // 3. Then we mark each unexplored node as explored and add it to the queue.
+      this.edges[t]
+      .filter(n => !explored.has(n))
+      .forEach(n => {
+         explored.add(n);
+         q.enqueue(n);
+      });
+   }
+}