《算法V》是由中國電力出版社於2003年12月出版的圖書，作者是塞奇威克（Robert Sedgewick）。
基本介紹
- 書名：算法V
- 作者：塞奇威克 (Robert Sedgewick)
- 頁數：482
- 出版社：中國電力出版社
- 出版時間：2003-12
- 裝幀：平裝
編輯推薦,圖書內容,作者簡介,TOP目錄,
編輯推薦
Robert Sedgewick再次給我們提供了重要的流行算法的全面介紹。這次的重點是圖形算法，圖形算法在很多套用中已日益重要，諸如網路連線、電路設計、調度、事務處理以及資源分配。本書中，Sedgewick同樣用簡潔的實現將理論和實踐成功地結合了起來，這些實現均可在真實套用上測試，這也正是他的著作多年來倍受程式設計師歡迎的原因。
圖書內容
本書是Sedgewick徹底修訂和重寫的叢書中的第二本。第一本(第Ⅰ-Ⅳ部分)介紹了基礎、數據結構、排序和搜尋。而即將出版的第三本重點在於字元串、幾何和一些高級算法。每本書的新增內容都包含了新的算法和實現，改進後的描述和圖表，以及用於提高技巧的大量練習。對抽象數據類型所花費的筆墨使得程式在更大範圍內有用，也和現代面向對象編程環境更為相關。本書包括以下內容：*圖形屬性和類型的完整綜述*有向無環圖和DAGs*最小生成樹*最短路徑*網路流程*圖表、樣例C代碼和詳細的算法描述。
作者簡介
Robert Sedgewick是普林頓大學的計算機科學教授。他是Adobe Systems公司的主管，並曾在施樂的帕洛阿爾托研究中心、美國國防防禦分析研究所和法國國立計算機與自動化研究所從事研究工作。他從史丹福大學獲得了博士學位。Sedgewick教授還和Philippe Flajolet合著了《An Introduction to the Analysis of Algorithms》一書。
TOP目錄
GraphAlgorithms
Chapter17.GraphProperties and Types
17.1 Glossary
17.2 GraphADT
17.3 Adjacency-Matrix Representation
17.4 Adjacency-Lists Representation
17.5 Variations,Extensions,and Costs
17.6 GraphGenerators
17.7 Simple,Euler,and Hamilton Paths
17.8 Graph-Processing Problems
Chapter18.Graph Search
18.1 Exploring a Maze
18.2 Depth-First Search
18.3 Graph-Search ADT Functions
18.4 PropertiesofDFSForests
18.5 DFS Algorithms
18.6 Separability and Biconnectivity
18.7 Breadth-FirstSearch
18.8 GeneralizedGraphSearch
18.9 AnalysisofGraphAlgorithms
Chapter19.Digraphs and DAGs
19.1 Glossary and Rulesof the Game
19.2 Anatomy of DFS in Digraphs
19.3 Reachability and Transitive Closure
19.4 Equivalence Relations and PartialOrders
19.5 DAGs
19.6 Topological Sorting
19.7 Reachability in DAGs
19.8 Strong Components in Digraphs
19.9 TransitiveClosure Revisited
19.10 Perspective
Chapter20.MinimumSpanningTrees
20.1 Representations
20.2 Underlying Principles of MST Algorithms
20.3 Prim's Algorithm and Priority-FirstSearch
20.4 Kruskal's Algorithm
20.5 Boruvka's Algorithm
20.6 Comparisons and Improvements
20.7 Euclidean MST
Chapter21.Shortest Paths
21.1 Underlying Principles
21.2 Dijkstra's algorithm
21.3 All-Pairs Shortest Paths
21.4 Shortest Pathsin Acyclic Networks
21.5 Euclidean Networks
21.6 Reduction
21.7 Negative Weights
21.8 Perspective
Chapter22.Network Flows
22.1 Flow Networks
22.2 Augmenting-Path Maxflow Algorithms
22.3 Preflow-Push Maxflow Algorithms
22.4 Maxflow Reductions
22.5 Mincost Flows
22.6 Network Simplex Algorithm
22.7 Mincost-Flow Reductions
22.8 Perspective
References for Part Five
Index
Chapter17.GraphProperties and Types
17.1 Glossary
17.2 GraphADT
17.3 Adjacency-Matrix Representation
17.4 Adjacency-Lists Representation
17.5 Variations,Extensions,and Costs
17.6 GraphGenerators
17.7 Simple,Euler,and Hamilton Paths
17.8 Graph-Processing Problems
Chapter18.Graph Search
18.1 Exploring a Maze
18.2 Depth-First Search
18.3 Graph-Search ADT Functions
18.4 PropertiesofDFSForests
18.5 DFS Algorithms
18.6 Separability and Biconnectivity
18.7 Breadth-FirstSearch
18.8 GeneralizedGraphSearch
18.9 AnalysisofGraphAlgorithms
Chapter19.Digraphs and DAGs
19.1 Glossary and Rulesof the Game
19.2 Anatomy of DFS in Digraphs
19.3 Reachability and Transitive Closure
19.4 Equivalence Relations and PartialOrders
19.5 DAGs
19.6 Topological Sorting
19.7 Reachability in DAGs
19.8 Strong Components in Digraphs
19.9 TransitiveClosure Revisited
19.10 Perspective
Chapter20.MinimumSpanningTrees
20.1 Representations
20.2 Underlying Principles of MST Algorithms
20.3 Prim's Algorithm and Priority-FirstSearch
20.4 Kruskal's Algorithm
20.5 Boruvka's Algorithm
20.6 Comparisons and Improvements
20.7 Euclidean MST
Chapter21.Shortest Paths
21.1 Underlying Principles
21.2 Dijkstra's algorithm
21.3 All-Pairs Shortest Paths
21.4 Shortest Pathsin Acyclic Networks
21.5 Euclidean Networks
21.6 Reduction
21.7 Negative Weights
21.8 Perspective
Chapter22.Network Flows
22.1 Flow Networks
22.2 Augmenting-Path Maxflow Algorithms
22.3 Preflow-Push Maxflow Algorithms
22.4 Maxflow Reductions
22.5 Mincost Flows
22.6 Network Simplex Algorithm
22.7 Mincost-Flow Reductions
22.8 Perspective
References for Part Five
Index
