Commit 9347968

committed

fix Aha-Algorithms chapter5

1 parent 9a36389 commit 9347968Copy full SHA for 9347968

File tree

+12

-4

lines changed

+12

-4

lines changed

Lines changed: 7 additions & 3 deletions

Original file line number	Diff line number	Diff line change
`@@ -1,11 +1,16 @@`
`1`	`1`	`/**`
`2`		`- * 图的遍历 bfs 实现`
	`2`	`+ * 图的遍历 bfs 广度优先搜索实现`
`3`	`3`	`*/`
`4`	`4`	`"use strict";`
`5`	`5`
`6`	`6`	`const util = require('../../util.js');`
`7`	`7`	`const Queue = require('../chapter2/Queue.js');`
`8`	`8`
	`9`	`+/**`
	`10`	`+ * 图的邻接矩阵表示`
	`11`	`+ * 第 i 行,第 j 列表示的就是顶点 i 到顶点 j 是否有边,1 表示有边,NAN 表示没边,0 表示自己到自己`
	`12`	`+ * @type {number[][]}`
	`13`	`+ */`
`9`	`14`	`var map = [`
`10`	`15`	`[0, 1, 1, NaN, 1],`
`11`	`16`	`[1, 0, NaN, 1, NaN],`
`@@ -26,7 +31,7 @@ result.push(start + 1);`
`26`	`31`	`book[start] = 1;`
`27`	`32`
`28`	`33`	`while (!queue.isEmpty()) {`
`29`		`- let cur = queue.first();`
	`34`	`+ let cur = queue.dequeue();`
`30`	`35`
`31`	`36`	`for (let i = 0; i < n; i++) {`
`32`	`37`	`if (map[cur][i] === 1 && book[i] === 0) {`
`@@ -35,7 +40,6 @@ while (!queue.isEmpty()) {`
`35`	`40`	`result.push(i + 1);`
`36`	`41`	`}`
`37`	`42`	`}`
`38`		`- queue.dequeue();`
`39`	`43`	`}`
`40`	`44`
`41`	`45`	`console.log('访问顺序', result);`

Lines changed: 5 additions & 1 deletion

Comments

(0)