数据结构课程讲义(C++)Chapter12_.pdfVIP

CHAPTER 12 Graphs 1 Bird-eye View • Congratulations! You have successfully journeyed through the forest of trees. Awaiting you now is the study of the graph data structure. • Surprisingly, graphs are used to model literally thousands of real world problems. 2 Topics • Terms: vertex （顶点）, edge （边）, adjacent （ 邻接）, incident （关联）, degree （度）, cycle （回路）, path （路径）, connected （连通）, component （构件）, spanning tree （生成树）; • Three types of graphs: undirected （无向）, directed （有向）, weighted （带权）; • Common graph representations: adjacency matrix （邻接矩阵）, packed-adjacency lists （邻接压 缩表）, linked-adjacency lists （邻接链表）. 3 Graphs • G = (V,E) • V is the vertex set. • Vertices are also called nodes and points. • E is the edge set. • Each edge connects two different vertices. • Edges are also called arcs and lines. • Directed edge has an orientation (u,v). u v 4 Graphs • Undirected edge has no orientation (u,v). u v • Undirected graph = no oriented edge. • Directed graph = every edge has an orientation. 5 Undirected Graph 2 3 8 1