done

Author: ApurbaKumarNath

3_Algorithms/Lab work/Lab 5/A.py

@@ -6,6 +6,7 @@
 Your task is to perform a Breadth-First Search (BFS) starting from node 1 and print the order in which the nodes are visited.
 '''
 
+
 from collections import deque
 
 n, m = map(int, input().split())

3_Algorithms/Lab work/Lab 5/B.py

@@ -5,6 +5,7 @@
 Your task is to perform a Depth-First Search (DFS) starting from node 1 and print the order in which the nodes are visited.
 '''
 
+
 import sys
 sys.setrecursionlimit(2*10**5 + 10)
 

3_Algorithms/Lab work/Lab 5/C.py

@@ -9,6 +9,7 @@
 If no path exists, print −1.
 '''
 
+
 from collections import deque
 def solve():
     n, m, s, dn = map(int, input().split()) # n = no. of vertices, m = no. of edges, s = start node, dn = destination node

3_Algorithms/Lab work/Lab 5/D.py

@@ -5,6 +5,7 @@
 If no such path exists, print −1.
 '''
 
+
 from collections import deque
 def solve():
     N, M, S, D, K = map(int, input().split()) # N = no. of vertices, M = no. of edges, S = start node, D = destination node, K = one node between S and D

3_Algorithms/Lab work/Lab 5/E.py

@@ -5,6 +5,7 @@
 Write a code to find if there is any cycle in the graph.
 '''
 
+
 import sys
 sys.setrecursionlimit(2*10**5 + 10)
 

3_Algorithms/Lab work/Lab 5/F.py

@@ -11,6 +11,7 @@
 such that you can collect the maximum number of diamonds
 '''
 
+
 from collections import deque
 
 R, H = map(int, input().split()) # R= rows, H=columns

3_Algorithms/Lab work/prev/1_bfs_3.py

@@ -20,6 +20,7 @@
 ..w.D
 .w.w.
 .....
+
 '''
 
 

3_Algorithms/Lab work/prev/1_bfs_5.py

@@ -18,7 +18,6 @@
 1 2 1
 0 1 0
 '''
-
 from collections import deque
 
 def solve():

3_Algorithms/Lab work/prev/1_bfs_7.py

@@ -12,7 +12,6 @@
 (1,1) (2,1) (3,1) (3,2) (3,3)
 '''
 
-
 from collections import deque
 
 def solve():