103课程算法课件ch7-1s jianrongmoshi

1、Aij(i, j)AAij(i, j)A100011000101001001110000CB1BCD1AD1EF FECBADAF01234510320144CBADAF0123451032014455125FE3ABEC3DA0123430B4C2D0EABEC3DA0123430B4C2D0ECh7.3 Traversing Ch7.3 Traversing 深度优先搜深度优先搜若图中仍存在V顶点Vfor (W1、V顶点Vfor (W1、W2、W3若该邻接点W未，CBCBADADFEFE深度优先搜索生成深度优先CBCBADADFEFE深度优先搜索生成深度优先搜索生成森实现方voiddfs(

2、G,v)/ 从顶点v出发，深度优先搜索遍历图实现方voiddfs(G,v)/ 从顶点v出发，深度优先搜索遍历图markvasforeachvertexwtedgevwisinifwisundiscoverdmarkvas/voidinitializeallofG tovoidinitializeallofG toforeachvertexif v is undiscoverd dfs(G, 1000110001010010011深度优先搜11000110001010010011深度优先搜1B-00103201-A12345C5AD12FE3广度优先搜从图中的某个顶点V0出发，并后V0的所有广度

3、优先搜从图中的某个顶点V0出发，并后V0的所有后的邻接点，直至图中所有和V0有路径相通的CBCBADADFEFECBCBADADFEFEbfsQueue pending=creat(n); marked v as discovered; enqueue(pending, v); while(pendingisnotempty)foreachvertexbfsQueue pending=creat(n); marked v as discovered; enqueue(pending, v); while(pendingisnotempty)foreachvertexhelistifwismar

4、kedwasenqueue(pending, 深度优先搜连通分深度优先搜连通分connected 并查深（广）度优先搜分析：时间 -分析：时间 -空有向无环有向无环BADC有向无环DAG图- 顶点之间有向无环DAG图- 顶点之间的偏序关若集合A中的二元关系R是自反的、非对称的和传递的，则R是A上的偏序关系。集合A与关系R一起称为一个偏序aRb或bRa ，则R是A上的全序关系。集合A与关系R一起拓扑排拓扑排序定义拓扑排拓扑排序定义GVoi nvwreverse toplgl 定理：若有向图G中存在回路，则G不存在拓扑排选一个入度为0的顶点选一个入度为0的顶点,输出3直到全部顶点输出或不存在入度为

5、0的顶若图中还有剩余顶点未被删除，说明图2514053251405325140532514053225140532251405322514053225140532514052251405225140522514052514052514052514052514052514052514052514052514052510300112031405151030011203140515103001120314051510300112031405151030010203140515103001020314051510300102031405151030010203140515130010203040515

6、13001020304051513001020304051513001020304051513001020304051513001020304051530010203040505300102030405050010203040505001020304050001020304050001020304050深度优先搜索构造拓扑深度优先搜索构造拓扑排深度优先搜索构造拓扑深度优先搜索构造拓扑排深度优先搜索构造拓扑排voidcolor深度优先搜索构造拓扑排voidcoloralltoforeachvertexifviswhitedfs(G,voiddfs(G, colorvasvoiddfs(G, colorva