Skip to content

Commit 3192964

dashidhy dashidhy

committed

fixed a bug; improved some code

1 parent 71ee72e commit 3192964Copy full SHA for 3192964

File tree

2 files changed

+12

-6

lines changed

basic_algorithm/graph
- bfs_dfs.md
- shortest_path.md

2 files changed

+12

-6

lines changed

`‎basic_algorithm/graph/bfs_dfs.md`

Lines changed: 6 additions & 3 deletions

Original file line number	Diff line number	Diff line change
`@@ -146,13 +146,16 @@ class Solution:`
`146`	`146`	`M, N = len(A), len(A[0])`
`147`	`147`	`neighors = ((-1, 0), (1, 0), (0, -1), (0, 1))`
`148`	`148`
	`149`	`+ dfs = []`
	`150`	`+ bfs = collections.deque([])`
	`151`	`+`
`149`	`152`	`for i in range(M):`
`150`	`153`	`for j in range(N):`
`151`	`154`	`if A[i][j] == 1: # start from a 1`
`152`		`- dfs= [(i, j)]`
	`155`	`+ dfs.append((i, j))`
`153`	`156`	`break`
`154`		`-`
`155`		`- bfs = collections.deque([])`
	`157`	`+if dfs:`
	`158`	`+ break`
`156`	`159`
`157`	`160`	`while dfs:`
`158`	`161`	`r, c = dfs.pop()`

`‎basic_algorithm/graph/shortest_path.md`

Lines changed: 6 additions & 3 deletions

Original file line number	Diff line number	Diff line change
`@@ -71,13 +71,16 @@ class Solution:`
`71`	`71`	`M, N = len(A), len(A[0])`
`72`	`72`	`neighors = ((-1, 0), (1, 0), (0, -1), (0, 1))`
`73`	`73`
	`74`	`+ dfs = []`
	`75`	`+ bfs = collections.deque([])`
	`76`	`+`
`74`	`77`	`for i in range(M):`
`75`	`78`	`for j in range(N):`
`76`	`79`	`if A[i][j] == 1: # start from a 1`
`77`		`- dfs= [(i, j)]`
	`80`	`+ dfs.append((i, j))`
`78`	`81`	`break`
`79`		`-`
`80`		`- bfs = collections.deque([])`
	`82`	`+if dfs:`
	`83`	`+ break`
`81`	`84`
`82`	`85`	`while dfs:`
`83`	`86`	`r, c = dfs.pop()`

0 commit comments

Comments

(0)