ppt课件-chap10_slides.ppt- universityof minnesota（chap10_slides。ppt -明尼苏达大学）.pptVIP

Graph Algorithms Ananth Grama, Anshul Gupta, George Karypis, and Vipin Kumar Topic Overview Definitions and Representation Minimum Spanning Tree: Prims Algorithm Single-Source Shortest Paths: Dijkstras Algorithm All-Pairs Shortest Paths Transitive Closure Connected Components Algorithms for Sparse Graphs Definitions and Representation An undirected graph G is a pair (V,E), where V is a finite set of points called vertices and E is a finite set of edges. An edge e ∈ E is an unordered pair (u,v), where u,v ∈ V. In a directed graph, the edge e is an ordered pair (u,v). An edge (u,v)