硕士算法2010_第5章_图的算法001讲述.pptVIP

算法设计与分析 李洪伟 博士 电子科技大学计算机科学与工程学院 hongweili@ /teacher/teacher.aspx?id=298 第5章 图的算法 图的概念 图的搜索问题 拓扑排序 强连通分支 最小生成树算法 最短路径算法 欧拉回路与中国邮递员问题 网络流及其应用 Graphs Definitions Graph Traversals Depth First Search (DFS) Breadth First Search (BFS) Topological Sort Shortest Paths Problems Minimum Spanning Tree (MST) 哥尼斯堡七桥问题 从任一地出发，是否能在每座桥只通过一次的前提下，游历全城最后又返回到原出发地？ Definition: Directed graph Directed Graph A directed graph, or digraph, is a pair G = (V, E) where V is a set whose elements are called vertices, and E is a set of ordered pairs of elements of V. Vertices are often also called nodes. Elements of E are called edges, or directed edges, or arcs. For directed edge (v, w) in E, v is its tail and w its head; (v, w) is represented in the diagrams as the arrow, v - w. In text we simple write vw. Definition: Undirected graph Undirected Graph A undirected graph is a pair G = (V, E) where V is a set whose elements are called vertices, and E is a set of unordered pairs of distinct elements of V. Vertices are often also called nodes. Elements of E are called edges, or undirected edges. Each edge may be considered as a subset of V containing two elements, {v, w} denotes an undirected edge In diagrams this edge is the line v---w. In text we simple write vw, or wv vw is said to be incident upon the vertices v and w Definitions: Weighted Graph A weighted graph is a triple (V, E, W) where (V, E) is a graph (directed or undirected) and W is a function from E into R, the reals . For an edge e, W(e) is called the weight of e. Graph Representations Adjacency Matrix Representation Let G = (V,E), n = |V|, m = |E|, V = {v1, v2, …, vn) G can be represented by an n ? n matrix Adjacency Matrix for weight digraph Array of Adjacency Lists Representation From to Array of Adjacency Lists Representation More Definitions Subgraph Symmetric digraph complete graph Adjacency relation Path, simple path, reachable Connected, Strongly Connected Cycle, simple cycle acyclic un