CSC 3102 Chapter : Csc3102GraphIntro
Document Summary
Supplementary notes: understand and use basic graph terminology and concepts, de ne and discuss basic graph structures, graph adt primitive operations, graph adjacency linked-list and matrix representations. De nition 1: a graph is a pair g = (v, e) of sets satisfying e [v ]2. V is the set of vertices and e is the set of edges, pairs of vertices: a directed graph or digraph is a graph in which the edges are or- dered. An undirected graph is one in which the edges are unordered: a graph with vertex set v is said to be a graph on v . The vertex set of a graph g is referred to as v (g), its edge set as e(g). A complete graph of order n is usually denoted k n or kn. A cycle is a path that consists of at least three vertices that starts and ends with the same vertex.
