[工学]数据结构Chapter7 Graph.ppt

Chap7 Graph Overview Graph Implementation of Graph Graph’s Traversal Graph’s Connectivity Minimum Spanning Tree Shortest Path DAG (Directed Acyclic Graph and its Application) Graph A tree is a hierarchical structure that consists of nodes emanating from a root. The nodes are connected by pointers that link a parent to its children. In this section, we introduce a graph, which is a generalized hierarchical structure. A graph is composed of a set of data items called vertices and a set of edges that connect pairs of vertices. Graph A graph G=(V, E) consists of a set of vertices, V, and a set of edges, E. Each edge is a pair (v, w), where v,w∈V. Edges are sometimes referred to as arcs. If the pair is ordered, then the graph is directed. Directed graphs are sometimes referred to as digraphs. Figure7.1 Directed Graph Vertices V={A, B, C, D, E} Edges E={(A,C), (A,D), (B,A), (B,D), (D,E),(E,B)} Figure7.2 Undirected Graph Vertices V={A, B, C, D, E} Edges E={(A,B), (A,C), (A,D), (B,A), (B,D),(B,E), (C,A), (D,A),(D,B),(D,E),(E,B),(E,D)} Graph Vertex w is adjacent to v if and only if (v,w) ∈E. In an undirected graph with edge(v,w), and hence (w,v), w is adjacent to v and v is adjacent to w. Sometimes an edge has a third component, known as either a weight or a cost. Graph In an undirected graph, if every pair of vertices are connected by an edge, then the graph is called undirected complete graph. The number of edges is N×(N-1)/2. In a directed graph, if every pair of vertices are connected by two opposite edges, then the graph is called directed complete graph. The number of edges is N×(N-1). Figure7.3 Undirected Complete Graph Figure7.4 Directed Complete Graph Graph A path in a graph is a sequence of vertices w1, w2, w3, …, wN such that (wi, wi+1) ∈E for 1≤i＜N. The length of such a path is the number of edges on the path, which is equal to N-1. We allow a path from a vertex to itself; If this path contains no edges, then the path length is 0. Gra