数据结构与算法 国家级双语教学示范课程配套教材 教学课件 彭军 向毅 Chap8 graph.pdfVIP

Data Structures and Algorithms Chapter 8: Graphs College of Electronic and Information Engineering Chongqing University of Science and Technology Instructor: Xiong Qian Spring 2013 Chapter 8 Graphs Graphs Objectives Upon completion you will be able to: • Understand and use basic graph terminology and concepts • Define and discuss basic graph and network structures • Design and implement graph and network applications • Design and implement applications using the graph ADT • Define and discuss Dijkstras shortest path algorithm Highlights 8-1 terminology 8-2 operations of graph 8-3 traverse graph 8-3-1 Depth-First Traversal 8-3-2 Breadth-First Traversal 8-4 graph storage structures 8-4-1 Adjacency Matrix 8-4-2 Adjacency List 8-5 graph algorithms 8-6 Graph ADT 8-7 networks 8-7-1 minimum spanning tree 8-7-2 shortest path algorithm 8-1 terminology A graph is a collection of vertices (nodes) and lines that connect pairs of vertices. Each node may have multiple predecessors and successors. A directed graph (digraph) has vertices that are connected through directional lines or arcs. An undirected graph has vertices connected through non- directional lines or edges. More Graph Concepts Two vertices are adjacent if an edge directly connects them A path is a sequence of adjacent vertices A cycle is a path that starts and ends with the same vertex A loop is a special case of a cycle in which a single arc begins and ends with the same vertex. Even Mor