feat: bfs-dfs-graph-traversal challenge

Author: IbatoLionDev

2-NORMAL/Python/5-bfs-dfs-graph-traversal/proposed-solution/graph.py

@@ -0,0 +1,62 @@
+from collections import deque
+
+class Graph:
+    def __init__(self, vertices):
+        self.V = vertices
+        self.adj = [[] for _ in range(vertices)]
+
+    def add_edge(self, u, v):
+        self.adj[u].append(v)
+        self.adj[v].append(u)  # Assuming undirected graph
+
+    def bfs(self, start):
+        visited = [False] * self.V
+        queue = deque([start])
+        visited[start] = True
+        result = []
+
+        while queue:
+            vertex = queue.popleft()
+            result.append(vertex)
+            for neighbor in self.adj[vertex]:
+                if not visited[neighbor]:
+                    visited[neighbor] = True
+                    queue.append(neighbor)
+        return result
+
+    def dfs_util(self, v, visited, result):
+        visited[v] = True
+        result.append(v)
+        for neighbor in self.adj[v]:
+            if not visited[neighbor]:
+                self.dfs_util(neighbor, visited, result)
+
+    def dfs(self, start):
+        visited = [False] * self.V
+        result = []
+        self.dfs_util(start, visited, result)
+        return result
+
+    def bfs_disconnected(self):
+        visited = [False] * self.V
+        result = []
+        for i in range(self.V):
+            if not visited[i]:
+                queue = deque([i])
+                visited[i] = True
+                while queue:
+                    vertex = queue.popleft()
+                    result.append(vertex)
+                    for neighbor in self.adj[vertex]:
+                        if not visited[neighbor]:
+                            visited[neighbor] = True
+                            queue.append(neighbor)
+        return result
+
+    def dfs_disconnected(self):
+        visited = [False] * self.V
+        result = []
+        for i in range(self.V):
+            if not visited[i]:
+                self.dfs_util(i, visited, result)
+        return result

2-NORMAL/Python/5-bfs-dfs-graph-traversal/proposed-solution/main.py

@@ -0,0 +1,25 @@
+# Challenge: Implement breadth-first search (BFS) and depth-first search (DFS) algorithms to traverse a graph represented by adjacency lists.
+# Ensure coverage of both connected and disconnected graphs.
+
+from graph import Graph
+
+def main():
+    g = Graph(7)
+    edges = [(0, 1), (0, 2), (1, 3), (1, 4), (2, 5), (5, 6)]
+    for u, v in edges:
+        g.add_edge(u, v)
+
+    print("BFS starting from vertex 0:")
+    print(g.bfs(0))
+
+    print("DFS starting from vertex 0:")
+    print(g.dfs(0))
+
+    print("BFS for disconnected graph:")
+    print(g.bfs_disconnected())
+
+    print("DFS for disconnected graph:")
+    print(g.dfs_disconnected())
+
+if __name__ == "__main__":
+    main()