123,123

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

　　本書(shū)是Sedgewick徹底修訂和重寫(xiě)的C算法系列的第二本，集中講解圖算法。全書(shū)共有6章（第17～22章）。第17章詳細(xì)討論圖性質(zhì)和類(lèi)型，第18～22章分別講解圖搜索、有向圖和DAG、最小生成樹(shù)、最短路徑以及網(wǎng)絡(luò)流。書(shū)中提供了用C語(yǔ)言描述的完整算法源程序，并且配有豐富的插圖和練習(xí)。作者用簡(jiǎn)潔的實(shí)現(xiàn)將理論和實(shí)踐成功地結(jié)合了起來(lái)，這些實(shí)現(xiàn)均可在真實(shí)應(yīng)用上測(cè)試，使得本書(shū)自問(wèn)世以來(lái)備受程序員的歡迎。本書(shū)可作為高等院校計(jì)算機(jī)相關(guān)專(zhuān)業(yè)算法與數(shù)據(jù)結(jié)構(gòu)課程的教材和補(bǔ)充讀物，也可供自學(xué)之用。本書(shū)作者的網(wǎng)站http：//www．cs．princeton．edu/～rs/為程序員提供了本書(shū)的源代碼和勘誤表。

作者簡(jiǎn)介

　　Robert Sedgewick擁有斯坦福大學(xué)博士學(xué)位（導(dǎo)師為Donald E.Knuth），普林斯頓大學(xué)計(jì)算機(jī)科學(xué)系教授，Adobe Systems公司董事，曾是Xerox PARC的研究人員，還曾就職于美國(guó)國(guó)防部防御分析研究所以及INRIA。險(xiǎn)本書(shū)外，他還與Philippe Flajolet合著了《算法分析導(dǎo)論》一書(shū)。

圖書(shū)目錄

Graph Algorithms
Chapter 17 Graph Properties and Types
17.1 Glossary
17.2 Graph ADT
17.3 Adjacency-Matrix Tepressentation
17.4 Adjacency-Lists Tepresentation
17.5 Variations, Extensions, and Costs
17.6 Graph Generators
17.7 Simple, Euler, and Hamilton Paths
17.8 Graph-Processing Problems
Chapter 17 Graph Search
18.1 Exploring a Maze
18.2 Depth-First Search
18.3 Graph-Search ADT Functins
18.4 Properties of DFS Forests
18.5 DFS Algorithms
18.6 Separability and Biconnectivity
18.7 Breadth-First Search
18.8 Feneralized Graph Search
18.9 Analysis of Graph Algorithms
Chapter 9 Aigraphs and DAGs
19.1 Glossary and ARules of the Game
19.2 Anatomy of DFS in Digraphs
19.3 Readchability 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 KrusKa's Algorithm
20.5 Boruvka's Algorithm
20.6 Comparisons and Improvements
20.7 Euclidean MST
Chapter 21 Shortest Paths
……
Chapter 22 Network Flows
References for Part Five
Indes