From 54b8ac097f11f6675bb7a92757c344f3e5b5b34a Mon Sep 17 00:00:00 2001
From: Ash <121093841+Ashirz@users.noreply.github.com>
Date: Thu, 12 Dec 2024 15:24:11 +0000
Subject: [PATCH] Update and rename BreathFirstSearch.java to
 BreadthFirstSearch.java

Replaced 'Breath' to 'Breadth'
---
 .../{BreathFirstSearch.java => BreadthFirstSearch.java}       | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)
 rename src/Algorithms/Breath First Search/{BreathFirstSearch.java => BreadthFirstSearch.java} (95%)

diff --git a/src/Algorithms/Breath First Search/BreathFirstSearch.java b/src/Algorithms/Breath First Search/BreadthFirstSearch.java
similarity index 95%
rename from src/Algorithms/Breath First Search/BreathFirstSearch.java
rename to src/Algorithms/Breath First Search/BreadthFirstSearch.java
index 7dc58cd..3bfed5d 100644
--- a/src/Algorithms/Breath First Search/BreathFirstSearch.java	
+++ b/src/Algorithms/Breath First Search/BreadthFirstSearch.java	
@@ -6,7 +6,7 @@ public class BreathFirstSearch {
     private List<List<Integer>> adjList;
 
     //BFS class constructor to the adjacency list
-    public BreathFirstSearch(int numVertices){
+    public BreadthFirstSearch(int numVertices){
         adjList = new ArrayList<>();
         for (int i = 0; i < numVertices; i++){
             adjList.add(new ArrayList<>());
@@ -78,7 +78,7 @@ private void bfsRecursiveUtil(Queue<Integer> queue, boolean[] visited){
 
     //Main method to demonstrate BFS
     public static void main(String[] args) {
-        BreathFirstSearch graph = new BreathFirstSearch(6);
+        BreadthFirstSearch graph = new BreadthFirstSearch(6);
 
         //Adding edges to the graph
         graph.addEdge(0, 1);