lec08-graphs.pptVIP

CS202 - Fundamental Structures of Computer Science II lec08-graphs GRAPHS – Definitions A graph G = (V, E) consists of a set of vertices, V, and a set of edges, E, where each edge is a pair (v,w) s.t. v,w ? V Vertices are sometimes called nodes, edges are sometimes called arcs. If the edge pair is ordered then the graph is called a directed graph (also called digraphs) . We also call a normal graph (which is not a directed graph) an undirected graph. When we say graph we mean that it is an undirected graph. Graph – Definitions Two vertices of a graph are adjacent if they are joined by an edge. Vertex w is adjacent to v iff (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. A path between two vertices is a sequence of edges that begins at one vertex and ends at another vertex. i.e. w1, w2, …, wN is a path if (wi, wi+1) ? E for 1 ? i ?. N-1 A simple path passes through a vertex only once. A cycle is a path that begins and ends at the same vertex. A simple cycle is a cycle that does not pass through other vertices more than once. Graph – An Example Graph -- Definitions A connected graph has a path between each pair of distinct vertices. A complete graph has an edge between each pair of distinct vertices. A complete graph is also a connected graph. But a connected graph may not be a complete graph. Directed Graphs If the edge pair is ordered then the graph is called a directed graph (also called digraphs) . Each edge in a directed graph has a direction, and each edge is called a directed edge. Definitions given for undirected graphs apply also to directed graphs, with changes that account for direction. Vertex w is adjacent to v iff (v,w) ? E. i.e. There is a direct edge from v to w w is successor of v v is predecessor of w A directed path between two vertices is a sequence of directed edges that begins at one vertex and ends at another vertex. i.e. w1, w2, …, wN is a path if (wi, wi+1) ? E for 1 ? i ?. N-