Google Drive Algo

Comments

Post a Comment

Popular posts from this blog

BFS in Python

Breadth First Search in Python # 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 ...
Read more

Merge Sort in Python

def mergeSort(nlist):     print("Splitting ",nlist)     if len(nlist)>1:         mid = len(nlist)//2         lefthalf = nlist[:mid]         righthalf = nlist[mid:]         mergeSort(lefthalf)         mergeSort(righthalf)         i=j=k=0         while i < len(lefthalf) and j < len(righthalf):             if lefthalf[i] < righthalf[j]:                 nlist[k]=lefthalf[i]                 i=i+1             else:                 nlist[k]=righthalf[j]                 j=j+1             k=k+1         while i < len(lefthalf):   ...
Read more

DFS in python

# Python3 program to print DFS traversal # from a given given graph 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) # A function used by DFS def DFSUtil(self, v, visited): # Mark the current node as visited # and print it visited[v] = True print(v, end = ' ') # Recur for all the vertices # adjacent to this vertex for i in self.graph[v]: if visited[i] == False: self.DFSUtil(i, visited) # The function to do DFS traversal. It uses # recursive DFSUtil() def DFS(self, v): # Mark all the vertices as not visited visited = [False] * (len(self.graph)) # Call the recursive helper function # to print DFS traversal self.DFSUtil(v, visited) #...
Read more