山东大学算法分与设计重点.pptVIP

p o s r u t y v w z n q n q p o s r u t y v w z 4 3 1 1 1 1 0 0 There are 4 distinct paths from p to v. Another example a b c d e f g h i j k l m a b c d e f g h i j k l m 16 8 8 4+4 4 4 2+2 2 1+1 2 1 1 1 There are 16 distinct paths from a to m. Another example a b c d e f g h i j k l m a b c d e f g h i j k l m 16 8 8 4+4 4 4 2+2 2 1+1 2 1 1 1 There are 16 distinct paths from a to m. 22.4-3 Given an algorithm that determines whether or not a given undirected graph G=(V,E) contains a cycle. O(V), independent of |E|. DFS, stops whenever encounters an back edge. 22.4-5 Note: 首先要计算每个点的入度。O(V+E) 当删一个点时，其邻接点的入度要减1。 O(V+E) 记录入度为0的点. 22.4-5 Proof of Correctness Induction on |V|. |V|=2, only one edge, trivial. Suppose it is true for |V|n. When |V|=n. Select a vertex s of in-degree zero.(must exist. Otherwise, all vertices have non-zero in-degrees. Start from a vertex and backtrack along in-edges. Since V is limited, the procedure must end at an in-edge which leaves a vertex already encountered, thus implies a cycle ). According to our algorithm, s will be at the most left of the list L. And the other part L’ of the list is exactly the list of the graph G’ obtained by deleting s and the edges leaving it. By induction hypothesis, all edges in G’ pointing from left to right in the list L’(thus also in L). Considering that all edges in G are either those in G’ or those leaving s, we completes the proof. for any (u,v)?E, the in-degree of v can not be zero before deleting u, which implies u appears in front of v. Dijkstra’s Algorithm Problem solved Correctness Time complexity Similarities to BFS and PRIM Problem Solved by Dijkstra’s Single-source shortest-paths problem Edge weight =0 Input: A graph G=(V, E) and a source s, and a nonnegative function w: E?R+ Output: For each vertex v, shortest path weight d(s,v), and a shortest path if exists. The Dijkstra Algorithm DIJKSTRA(G,w,s) Initialize-Single-Source(G,s) S?? Q?V[G] while Q?? do u?EXTRACT-MIN(Q) S?S?