Commit 537e798

committed

Update 05.Graph-Topological-Sorting.md

1 parent 8487306 commit 537e798Copy full SHA for 537e798

File tree

-1

lines changed

-1

lines changed

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -4,7 +4,7 @@`
`4`	`4`
`5`	`5`	`图的拓扑排序是针对有向无环图(DAG)来说的,无向图和有向有环图没有拓扑排序,或者说不存在拓扑排序。`
`6`	`6`
`7`		`-![](https://qcdn.itcharge.cn/images/20230504153551.png)`
	`7`	`+![有向无环图](https://qcdn.itcharge.cn/images/202405092308713.png)`
`8`	`8`
`9`	`9`	`如上图中的有向无环图(DAG)所示,$v_1 \rightarrow v_2 \rightarrow v_3 \rightarrow v_4 \rightarrow v_5 \rightarrow v_6$ 是该图的一个拓扑序列。与此同时,$v_1 \rightarrow v_2 \rightarrow v_3 \rightarrow v_4 \rightarrow v_6 \rightarrow v_5$ 也是该图的一个拓扑序列。也就是说,对于一个有向无环图来说,拓扑序列可能不止一个。`
`10`	`10`

Comments

(0)