关于图--数据结构.pdf

Data Structures and Algorithms School of Software Engineering Chongqing University Chongqing, China Lectured by Caibin caibin@cqu.edu.cn Data Structures and Algorithms School of Software Engineering, Chongqing University Today’s topics 12.1 Mathematical Background 12.2 Computer Representation(计算机表示) 12.3 Graph Traversal(图的遍历) 12.4 Topological Sorting(拓扑排序) 12.5 A Greedy Algorithm: Shortest Paths(最短路径) 12.6 Minimal Spanning Trees(最小生成树) 12.7 Graphs as Data Structures 2 Data Structures and Algorithms School of Software Engineering, Chongqing University 12.1 Mathematical Background Definitions 1. Agraph G consists of a set V , whose members are called the vertices of G, together with a set E of pairs of distinct vertices from V . 2. The pairs in E are called the edges of G. 3. If e = (v, w) is an edge with vertices v and w, then v and w are said to lie on e, and e is said to be incident with v and w. 4. If the pairs are unordered, G is called an undirected graph. 5. If the pairs are ordered, G is called a directed graph. The term directed graph is often shortened to digraph, and the unqualified term graph usually means undirected graph. 6. Two vertices in an undirected graph are called adjacent if there is an edge from the first to the second. 7. A path is a sequence of distinct vertices, each adjacent to the next.