Commit 3eeff90

committed

BFS Implementation

1 parent f156551 commit 3eeff90Copy full SHA for 3eeff90

File tree

+24

-1

lines changed

+24

-1

lines changed

Lines changed: 24 additions & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -20,4 +20,27 @@`
`20`	`20`	`Time Complexity: O(V + E)`
`21`	`21`	`Space Complexity: O(V)`
`22`	`22`	`V is number of vertices (nodes), E is number of edges`
`23`		`-'''`
	`23`	`+'''`
	`24`	`+`
	`25`	`+class Graph:`
	`26`	`+ def __init__(self):`
	`27`	`+ self.graph = {}`
	`28`	`+`
	`29`	`+ def insertEdge(self, v1, v2):`
	`30`	`+ if v1 in self.graph:`
	`31`	`+ self.graph[v1].append(v2)`
	`32`	`+ else:`
	`33`	`+ self.graph[v1] = [v2]`
	`34`	`+`
	`35`	`+ def BSF(self, start_node):`
	`36`	`+ visited, queue = {start_node}, [start_node]`
	`37`	`+`
	`38`	`+ while queue:`
	`39`	`+ cur = queue.pop(0)`
	`40`	`+ print(cur, end = " ")`
	`41`	`+`
	`42`	`+ if cur in self.graph:`
	`43`	`+ for node in self.graph[cur]:`
	`44`	`+ if node not in visited:`
	`45`	`+ queue.append(node)`
	`46`	`+ visited.add(node)`

Comments

(0)