ch07--Graph.ppt

Chapter 7 Graphs Graph Terminology（术语） Graph Implementation Graph traversals Topological Sort Shortest Paths Problems Minimum-Cost Spanning Trees Graph Terminology Terminology Terminology Terminology Terminology Terminology Terminology Terminology Graph ADT Graph Implementation Adjacency Matrix Adjacency Matrix Adjacency Matrix For Weighted Graphs Adjacency Matrix Implementation Some Operations in Adjacency Matrix Adjacency List Adjacency List Adjacency List Implementation Some Operations in Adjacency List Graph traversals Topological Sort Graph traversals Depth-First Search (DFS) Depth-First Search Implementing a DFS Depth-First Search Breadth-First Search (BFS) Breadth-First Search Implementing a BFS Breadth-First Search Topological Ordering Applications of Topological Orderings Topological Ordering by DFS Topological Ordering by DFS Depth-First Traversal Trace Depth-First Traversal Trace Topological Ordering by BFS Topological Ordering by BFS Topological Ordering by BFS Topological Ordering by BFS BFS Trace Shortest Paths Problems Shortest Paths Single-Source Shortest Paths Dijkstras Algorithm Dijkstras Algorithm Dijkstras Algorithm(continue) Dijkstras Algorithm Trace Record the Shortest Paths Dijkstras Algorithm Dijkstras Algorithm Example of Dijkstras Algorithm All-Pairs Shortest Paths Floyds Algorithm Floyds Algorithm Floyds Algorithm Minimum-Cost Spanning Trees Prims algorithm Prim‘s algorithm(扩点法) Example of Prims algorithm Prims algorithm Kruskal‘s algorithm (扩边法) Kruskals algorithm Example of Kruskals algorithm Suppose that G is a directed graph which contains no directed cycles. Then a topological ordering of the vertices in G is a sequential listing of the vertices such that for any pair of vertices, v and w in G, if v,w is an edge in G then v precedes w in the sequential listing. 4 3 5 2 1 0 4 3 5 2 1 0 Applications of topological orderings are relatively common… prerequisite relationships among courses glossary of techn