From 7200f5ed0ffad710b2f75302c3781b7e01f8f146 Mon Sep 17 00:00:00 2001
From: Akshat Mishra <103744846+Akshatmish@users.noreply.github.com>
Date: Sun, 9 Oct 2022 16:30:41 +0530
Subject: [PATCH 1/2] Create Ak.py

I have made a small code to understand the difference between list and tuple. This code will generate a list or tuple. Please accept this code and approve the request to Hacktoberfest 2022
---
 Ak.py | 5 +++++
 1 file changed, 5 insertions(+)
 create mode 100644 Ak.py

diff --git a/Ak.py b/Ak.py
new file mode 100644
index 0000000..80da2ad
--- /dev/null
+++ b/Ak.py
@@ -0,0 +1,5 @@
+values= = input("enter a number:")6
+list = values.split(",")
+tuple = tuple(list)
+print('list :'.list)
+print('tuple :',tuple)

From 906c47f1b7f1ae254c800fb2b4f5608ac6808fa2 Mon Sep 17 00:00:00 2001
From: Akshat Mishra <103744846+Akshatmish@users.noreply.github.com>
Date: Sun, 9 Oct 2022 17:44:54 +0530
Subject: [PATCH 2/2] Create readme.md

This code will simply do BFS  function . please approve it for hacktoberfest2022.
---
 readme.md | 66 +++++++++++++++++++++++++++++++++++++++++++++++++++++++
 1 file changed, 66 insertions(+)
 create mode 100644 readme.md

diff --git a/readme.md b/readme.md
new file mode 100644
index 0000000..a126709
--- /dev/null
+++ b/readme.md
@@ -0,0 +1,66 @@
+# Python3 Program to print BFS traversal
+# from a given source vertex. BFS(int s)
+# traverses vertices reachable from s.
+from collections import defaultdict
+
+# This class represents a directed graph
+# using adjacency list representation
+class 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)
+
+	# Function to print a BFS of graph
+	def BFS(self, s):
+
+		# Mark all the vertices as not visited
+		visited = [False] * (len(self.graph))
+
+		# Create a queue for BFS
+		queue = []
+
+		# Mark the source node as
+		# visited and enqueue it
+		queue.append(s)
+		visited[s] = True
+
+		while queue:
+
+			# Dequeue a vertex from
+			# queue and print it
+			s = queue.pop(0)
+			print (s, end = " ")
+
+			# Get all adjacent vertices of the
+			# dequeued vertex s. If a adjacent
+			# has not been visited, then mark it
+			# visited and enqueue it
+			for i in self.graph[s]:
+				if visited[i] == False:
+					queue.append(i)
+					visited[i] = True
+
+# Driver code
+
+# Create a graph given in
+# the above diagram
+g = Graph()
+g.addEdge(0, 1)
+g.addEdge(0, 2)
+g.addEdge(1, 2)
+g.addEdge(2, 0)
+g.addEdge(2, 3)
+g.addEdge(3, 3)
+
+print ("Following is Breadth First Traversal"
+				" (starting from vertex 2)")
+g.BFS(2)
+
+# This code is contributed by Neelam Yadav