算法分析与设计2004春.课件.第07讲【荐】.pdfVIP

Lecture 7. Elementary Graphics Algorithm • Representation of graphics • Breadth-first search • Depth-first search • Topological sort • Strongly connected components 清华大学宋斌恒 1 图的应用背景 • Petri－Net • Work Flow • 可以利用图描述的经典问题有 – 城市与连接城市的道路 – 区域与隔离区域间的分界线 – 人与人之间的认识关系 – More ？ – 什么问题可以抽象成图？ 清华大学宋斌恒 2 Representation of graphs • Definition of a graph: – G = (V, E) where V is a set of vertices, E is another set call Edges is a sub set of the following set: – {(u,v): u and v is element of V} • Concepts of graphs: 2 – Dense graph: if |E| is close to |V| . – Sparse graph: If it is not dense 清华大学宋斌恒 3 1 2 2 5 / 0 1 0 0 1 1 5 3 4 / 1 0 1 1 1 3 2 4 / 0 1 0 1 0 0 1 1 0 1 2 5 3 / 5 4 4 1 2 / 1 1 0 1 0 Figure 22.1 Two representations of an undirected graph. (a) An undirected graph G having five vertices and seven edges. (b) An adjacency-list representation of G. (c) The adjacency-matrix representation of G. 清华大学宋斌恒 4 2 4 / 0 1 0 1 0 0 5 / 0 0 0 0 1 0 1 2 3