Commit d517b53

committed

修复和优化语句表述

1 parent beb0d85 commit d517b53Copy full SHA for d517b53

File tree

+171

-232

lines changed

+171

-232

lines changed

Lines changed: 2 additions & 2 deletions

Original file line number	Diff line number	Diff line change
`@@ -53,8 +53,8 @@`
`53`	`53`
`54`	`54`	`根据图中是否存在环,可以将图分为「环形图」和「无环图」:`
`55`	`55`
`56`		`-- 环形图(Circular Graph):如果图中至少存在一条环,则称为环形图。`
`57`		`-- 无环图(Acyclic Graph):如果图中不存在任何环,则称为无环图。`
	`56`	`+- 环形图(Cyclic Graph):如果图中至少存在一条环(Cycle),则称该图为环形图或含环图。`
	`57`	`+- 无环图(Acyclic Graph):如果图中不存在任何环,则称该图为无环图。`
`58`	`58`
`59`	`59`	`对于有向图,如果不存在环,则称为「有向无环图(Directed Acyclic Graph, DAG)」。DAG 结构在动态规划、最短路径、数据压缩等算法中有着广泛应用。`
`60`	`60`

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -4,7 +4,7 @@`
`4`	`4`
`5`	`5`	`以阶乘为例,数学定义如下:`
`6`	`6`
`7`		`-$fact(n) = \begin{cases} 1 & \text{n = 0} \cr n \times fact(n - 1) & \text{n > 0} \end{cases}$`
	`7`	`+$$fact(n) = \begin{cases} 1 & \text{n = 0} \cr n \times fact(n - 1) & \text{n > 0} \end{cases}$$`
`8`	`8`
`9`	`9`	`我们可以直接用调用函数自身的方式实现阶乘函数 $fact(n),ドル代码如下:`
`10`	`10`

Comments

(0)