Mark Allen Weiss 数据结构与算法分析 课后习题答案9.pdfVIP

Chapter 9: Graph Algorithms 9.1 The following ordering is arrived at by using a queue and assumes that vertices appear on an adjacency list alphabetically. The topological order that results is then s, G, D, H, A, B, E, I, F, C, t 9.2 Assuming the same adjacency list, the topological order produced when a stack is used is s, G, H, D, A, E, I, F, B, C, t Because a topological sort processes vertices in the same manner as a breadth-first search, it tends to produce a more natural ordering. 9.4 The idea is the same as in Exercise 5.10. 9.5 (a) (Unweighted paths) A-B, A-C, A-B-G, A-B-E, A-C-D, A-B-E-F. (b) (Weighted paths) A-C, A-B, A-B-G, A-B-G-E, A-B-G-E-F, A-B-G- E-D. 9.6 We’ll assume that Dijkstra’s algorithm is implemented with a priority queue of vertices that uses the DecreaseKeyO operation. Dijkstra’s algorithm uses O |OEO |O DecreaseKeyO operations, which cost OO (log O |O VO |O) each, and O |O VO |O DeleteMinO operations, which cost OO (dOlog O |O VO |O) dO dO each. The running time is thus OO (O |OEO |Olog O |O VO |O + O |O VO |OdOlog O |O VO |O). The cost of the dO dO DecreaseKeyO operations balances the InsertO operations when dO = O |OEO |O/O |O VO |O . For a sparse graph, this might give a value of dO that is less than 2; we can’t allow this, so dO is chosen to be max (2,OIO |OEO |O/O |O VO |OOK). This gives a running time of OO (O |OEO |Olog2 + O |OEO |O/O |O VO |OO |O VO |O), which is a slight theoretical improvement. Moret and Shapiro report (indirectly) that dO -heaps do not improve the runn