README.mdd

Author: LoicKonan

Assignments/A16/main.py

@@ -4,63 +4,32 @@
 # Date: 11/08/2021 
 
 class Person:
-      # instance variable
   grade = 0
   name = ""
 
-  # constructor
   def __init__(self, a = 0, b = ""):
     self.grade = a
     self.name = b
 
-  # mutator and accessor
   def set_grade(self, newGrade):
     self.grade = newGrade
 
   def get_grade(self):
     return self.grade
 
 
-  # instance method
   def close(self):
     print('I am closing')
 
-  # instance method
   def greeting(self, g):
-    # print('Your grade was: ', self.get_grade())
-    # self.set_grade(0)
-    # print('I assigned your garde to: ', self.grade)
     print(g, self.name)
-    #self.close()
 
 class Student(Person):
   gradYear = 0
   def __init__(self, grade, name, graduationYear):
-    #super.__init__()
     Person.__init__(self, grade, name)
     self.gradYear = graduationYear
 
 
-
 stu1 = Student(100, 'Saikat', 2021)
-print(stu1.grade, stu1.name)
-# stu1.greeting('Hello')
-
-
-
-# obj1 = Person(23, 'Saikat')
-# obj2 = Person(100, 'Das')
-# oldGrade = obj1.get_grade()
-# print('Your grade was: ', oldGrade)
-# obj1.set_grade(oldGrade+10)
-# print('Your current grade is: ', obj1.grade)
-# g = "Hello "
-# # print(obj1.name, obj1.grade)
-# # print(obj2.name, obj2.grade)
-# obj1.greeting(g)
-# # obj1.close()
-
-#print('Hello World')
-
-# def greet():
-#   pass
+print(stu1.grade, stu1.name)

Assignments/A18/class.py

@@ -1,39 +1,24 @@
-def __init__(self):
-    """
-    initialize your data structure here.
-    """
-    self.stack = []
+class MinStack:
+    def __init__(self):
+        self.stack = []
 
-def push(self, x):
-    """
-    :type x: int
-    :rtype: None
-    """
-    if not self.stack:
-        self.stack.append((x, x))
-    else:
-        self.stack.append((x, min(x, self.stack[-1][1])))
+    def push(self, x):
+        if not self.stack:
+            self.stack.append((x, x))
+        else:
+            self.stack.append((x, min(x, self.stack[-1][1])))
 
-def pop(self):
-    """
-    :rtype: None
-    """
-    self.stack.pop()
+    def pop(self):
+        self.stack.pop()
 
-def top(self):
-    """
-    :rtype: int
-    """
-    if self.stack:
-        return self.stack[-1][0]
-    else:
-        return None
+    def top(self):
+        if self.stack:
+            return self.stack[-1][0]
+        else:
+            return None
 
-def getMin(self):
-    """
-    :rtype: int
-    """
-    if self.stack:
-        return self.stack[-1][1]
-    else:
-        return None
+    def getMin(self):
+        if self.stack:
+            return self.stack[-1][1]
+        else:
+            return None

Assignments/A20/main.py

@@ -1,45 +1,42 @@
-# Python
-# @author Loic Konan
-# Semester: Fall 2021
-# Date: 11/22/2021 
+'''Python program to print DFS traversal for complete graph'''
+from collections import defaultdict
 
+# this class represents a directed graph using adjacency list representation
 
-from collections import defaultdict
 
 class Graph:
-  def __init__(self):
-    self.graph = defaultdict(list)
-    self.nodes = 12
-    # function to add an edge to graph
-  def addEdge(self,u,v):
-    self.graph[u].append(v)
-    
-  def BFS(self, root):
-    visited = [False] * (self.nodes + 1)
-    # print(len(visited))
-    q = []
-    q.append(root)
-    visited[root] = True
-
-    while len(q) != 0:
-      root = q.pop(0)
-      print(root, end = " ")
-
-      for i in self.graph[root]:
-        if visited[i] == False:
-          q.append(i)
-          visited[i] = True
-
-
-  def dfs(self, visited, node):
-    if node not in visited:
-      print(node, end = " ")
-      visited.add(node)
-      for neighbor in self.graph[node]:
-        self.dfs(visited, neighbor)
-
-  def printGraph(self):
-    print(self.graph)
+	# Constructor
+	def __init__(self):
+		# default dictionary to store graph
+		self.graph = defaultdict(list)
+
+	# Function to add an edge to graph
+	def addEdge(self, u, v):
+		self.graph[u].append(v)
+	# A function used by DFS
+
+	def DFSUtil(self, v, visited):
+		# Mark the current node as visited and print it
+		visited.add(v)
+		print(v)
+
+		# recur for all the vertices adjacent to this vertex
+		for neighbour in self.graph[v]:
+			if neighbour not in visited:
+				self.DFSUtil(neighbour, visited)
+		# The function to do DFS traversal. It uses recursive DFSUtil
+
+	def DFS(self):
+		# create a set to store all visited vertices
+		visited = set()
+		# call the recursive helper function to print DFS traversal starting from all
+		# vertices one by one
+		for vertex in self.graph:
+			if vertex not in visited:
+				self.DFSUtil(vertex, visited)
+# Driver code
+# create a graph given in the above diagram
+
 
 g = Graph()
 g.addEdge(0, 1)
@@ -48,7 +45,5 @@ def printGraph(self):
 g.addEdge(2, 0)
 g.addEdge(2, 3)
 g.addEdge(3, 3)
-
-
-g.BFS(2)
+g.DFS()