Graph Theory SJSU Computer Science Department图论州立圣何塞大学计算机科学系.pptVIP

Graph Theory Arnold Mesa Basic Concepts A graph G = (V,E) is defined by a set of vertices and edges Basic Concepts (cont.) A vertex (v1) is said to be adjacent to (v2) if and only if they share a common edge (e1). Basic Concepts (cont.) A directed graph or digraph is a graph where direction matters. Movement in the graph is determined by the direction of the edge. Basic Concepts (cont.) A path in a graph is a sequence of vertices (v1, v2, v3,…,vn). The path length is determined by how many edges are on the path. Adjacency List Representation More terms… An edge may have a component known as