Java算法：圖算法（第2卷）

定　價(jià)：￥55.00

作　者：	（美）Robert Sedgewick著
出版社：	清華大學(xué)出版社
叢編項(xiàng)：
標(biāo)　簽：	算法

購(gòu)買這本書可以去

ISBN：	9787302072980	出版時(shí)間：	2004-04-01	包裝：	平裝
開(kāi)本：	23cm	頁(yè)數(shù)：	497	字?jǐn)?shù)：

內(nèi)容簡(jiǎn)介

　　本書深入介紹了圖算法。書中分別對(duì)圖屬性和類型、圖搜索、有向圖、最小生成樹(shù)、最短路徑以及網(wǎng)絡(luò)流的有關(guān)內(nèi)容進(jìn)行了透徹的討論。在此不僅對(duì)基本內(nèi)容做了全面的闡述，而且對(duì)經(jīng)典算法也提供了詳盡的分析，同時(shí)還涵蓋了有關(guān)的高級(jí)主題。全書既強(qiáng)調(diào)了與實(shí)用有關(guān)的內(nèi)容，在分析和理論研究上也很有深度。另外，對(duì)于書中提供的算法，讀者可以放心地實(shí)現(xiàn)和調(diào)試，并用這些算法來(lái)解決問(wèn)題。本書內(nèi)容全面、論述清晰，適合于計(jì)算機(jī)科學(xué)和數(shù)學(xué)領(lǐng)域各個(gè)層次的人員使用。

作者簡(jiǎn)介

暫缺《Java算法：圖算法（第2卷）》作者簡(jiǎn)介

圖書目錄

Graph Algorithms
     Chapter 17. Graph Properties and Types

17.1 Glossary

17.2 Graph ADT

17.3 Adjacency-Matrix Representation

17.4 Adjacency-Lists Representation

17.5 Variations, Extensions, and Costs

17.6 Graph Generators

17.7 Simple, Euler, and Hamilton Paths

17.8 Graph-Processing Problems
     Chapter 18. Graph Search

18.1 Exploring a Maze

18.2 Depth-First Search

18.3 Graph-Search ADT Methods

18.4 Properties of DFS Forests

18.5 DFS Algorithms

18.6 Separability and Biconnectivity

18.7 Breadth-First Search

18.8 Generalized Graph Search

18.9 Analysis of Graph Algorithms
     Chapter 19. Digraphs and DAGs

19.1 Glossary and Rules of the Game

19.2 Anatomy of DFS in Digraphs

19.3 Reachability and Transitive Closure

19.4 Equivalence Relations and Partial Orders

19.5 DAGs

19.6 Topological Sorting

19.7 Reachability in DAGs

19.8 Strong Components in Digraphs

19.9 Transitive Closure Revisited

19.10 Perspective
     Chapter 20. Minimum Spanning Trees

20.1 Representations

20.2 Underlying Principles of MST Algorithms

20.3 Prim''s Algorithm and Priority-First Search

20.4 Kruskal''s Algorithm

20.5 Boruvka''s Algorithm

20.6 Comparisons and Improvements

20.7 Euclidean MST

Chapter 21. Shortest Paths

21.1 Underlying Principles

21.2 Dijkstra''s Algorithm

21.3 All-Pairs Shortest Paths

21.4 Shortest Paths in Acyclic Networks

21.5 Euclidean Networks

21.6 Reduction

21.7 Negative Weights

21.8 Perspective
     Chapter 22. Network Flow

22.1 Flow Networks

22.2 Augmenting-Path Maxfiow Algorithms

22.3 Prefiow-Push Maxfiow Algorithms

22.4 Maxfiow Reductions

22.5 Mincost Flows

22.6 Network Simplex Algorithm

22.7 Mincost-Flow Reductions

22.8 Perspective
     References for Part Five
     Index