DATASTRUCTURE.pptVIP

计算机科学与工程系 计算机科学与工程系 CHAPTER 4 Graphs Basic terminology Graph Implementation Graph Traversals Minimal Cost Spanning Tree Shortest Path Problem 4.1 Graphs 1) Definition A graph G consists of two sets a finite, nonempty set of vertices V(G) a finite, possible empty set of edges E(G) G(V,E) represents a graph The number of vertices is written |V|, and the number edges is written |E|. General graphs differ from trees need not have a root node no implicit parent-child relationship may be several (or no) paths from one vertex to another. An undirected graph is one in which the pair of vertices in a edge is unordered, (v0, v1) = (v1,v0) A directed graph is one in which each edge is a directed pair of vertices, v0, v1 != v1,v0 A complete graph is a graph that has the maximum number of edges for undirected graph with n vertices, the maximum number of edges is n(n-1)/2 for directed graph with n vertices, the maximum number of edges is n(n-1) 2）ADT of Graph ADT Graph { Objects: a nonempty set of vertices and a set of edges, where each edge is a pair of vertices Functions: for all graph?Graph, v, v1 and v2?Vertices Graph Create()::=return an empty graph Graph DeleteEdge(graph, v1, v2)::=return a graph in which the edge (v1, v2) is removed Boolean IsEmpty(graph)::= if (graph==empty graph) return TRUE; else return FALSE … … } ADT Graph 4.2 Graph Implementation 1) Definition:Let G=(V,E) be a graph with n vertices. The adjacency matrix of G is a two-dimensional n by n array, say A[n][n] For a weighted digraph 3) Declaration 4) Create a Graph 4.2.2 Adjacency List 1) Adjacency List Each row in adjacency matrix is represented as an adjacency list. The graph is represented by an array or vector v[1], v[2],...,v[n], one element for each vertex in the digraph. Each v[i] stores the data stored in vertex i together w