Commit 8bf43eb

committed

Three Hundred - Fifty-Three Commit: Create graph-depth-first-search-demo.py

1 parent 619d1d5 commit 8bf43ebCopy full SHA for 8bf43eb

File tree

-8

lines changed

-8

lines changed

Lines changed: 4 additions & 4 deletions

Original file line number	Diff line number	Diff line change
`@@ -50,6 +50,7 @@ class Graph:`
`50`	`50`	`def __init__(self, vertices):`
`51`	`51`	`self._vertices = vertices`
`52`	`52`	`self._adjacent_matrix = np.zeros((vertices, vertices))`
	`53`	`+ self._visited = [0] * self._vertices`
`53`	`54`
`54`	`55`	`def insert_edge(self, u, v, weight_edge = 1):`
`55`	`56`	`self._adjacent_matrix[u][v] = weight_edge`
`@@ -103,16 +104,15 @@ def display_adjacent_matrix(self):`
`103`	`104`	`def BFS(self, source_vertex):`
`104`	`105`	`i = source_vertex`
`105`	`106`	`q = LinkedListQueue()`
`106`		`- visited = [0] * self._vertices`
`107`	`107`	`print(i, end=' ')`
`108`		`- visited[i] = 1`
	`108`	`+ self._visited[i] = 1`
`109`	`109`	`q.enqueue(i)`
`110`	`110`	`while not q.is_empty():`
`111`	`111`	`i = q.dequeue()`
`112`	`112`	`for j in range(self._vertices):`
`113`		`- if self._adjacent_matrix[i][j] == 1 and visited[j] == 0:`
	`113`	`+ if self._adjacent_matrix[i][j] == 1 and self._visited[j] == 0:`
`114`	`114`	`print(j, end=' ')`
`115`		`- visited[j] = 1`
	`115`	`+ self._visited[j] = 1`
`116`	`116`	`q.enqueue(j)`
`117`	`117`
`118`	`118`	`def DFS(self,source_vertex):`

Whitespace-only changes.

Lines changed: 5 additions & 4 deletions

Original file line number	Diff line number	Diff line change
`@@ -5,6 +5,7 @@ class Graph:`
`5`	`5`	`def __init__(self, vertices):`
`6`	`6`	`self._vertices = vertices`
`7`	`7`	`self._adjacent_matrix = np.zeros((vertices, vertices))`
	`8`	`+ self._visited = [0] * self._vertices`
`8`	`9`
`9`	`10`	`def insert_edge(self, u, v, weight_edge = 1):`
`10`	`11`	`self._adjacent_matrix[u][v] = weight_edge`
`@@ -58,16 +59,16 @@ def display_adjacent_matrix(self):`
`58`	`59`	`def BFS(self, source_vertex):`
`59`	`60`	`i = source_vertex`
`60`	`61`	`q = LinkedListQueue()`
`61`		`-visited= [0] *self._vertices`
	`62`	`+`
`62`	`63`	`print(i, end=' ')`
`63`		`- visited[i] = 1`
	`64`	`+ self._visited[i] = 1`
`64`	`65`	`q.enqueue(i)`
`65`	`66`	`while not q.is_empty():`
`66`	`67`	`i = q.dequeue()`
`67`	`68`	`for j in range(self._vertices):`
`68`		`- if self._adjacent_matrix[i][j] == 1 and visited[j] == 0:`
	`69`	`+ if self._adjacent_matrix[i][j] == 1 and self._visited[j] == 0:`
`69`	`70`	`print(j, end=' ')`
`70`		`- visited[j] = 1`
	`71`	`+ self._visited[j] = 1`
`71`	`72`	`q.enqueue(j)`
`72`	`73`
`73`	`74`	`def DFS(self,source_vertex):`

Comments

(0)