算法V

內(nèi)容概要

Robert Sedgewick再次給我們提供了重要的流行算法的全面介紹。這次的重點(diǎn)是圖形算法，圖形算法在很多應(yīng)用中已日益重要，諸如網(wǎng)絡(luò)連接、電路設(shè)計(jì)、調(diào)度、事務(wù)處理以及資源分配。本書中，Sedgewick同樣用簡(jiǎn)潔的實(shí)現(xiàn)將理論和實(shí)踐成功地結(jié)合了起來，這些實(shí)現(xiàn)均可在真實(shí)應(yīng)用上測(cè)試，這也正是他的著作多年來倍受程序員歡迎的原因。　　本書是Sedgewick徹底修訂和重寫的叢書中的第二本。第一本(第Ⅰ-Ⅳ部分)介紹了基礎(chǔ)、數(shù)據(jù)結(jié)構(gòu)、排序和搜索。而即將出版的第三本重點(diǎn)在于字符串、幾何和一些高級(jí)算法。每本書的新增內(nèi)容都包含了新的算法和實(shí)現(xiàn)，改進(jìn)后的描述和圖表，以及用于提高技巧的大量練習(xí)。對(duì)抽象數(shù)據(jù)類型所花費(fèi)的筆墨使得程序在更大范圍內(nèi)有用，也和現(xiàn)代面向?qū)ο缶幊汰h(huán)境更為相關(guān)?！　”緯ㄒ韵聝?nèi)容：　　*圖形屬性和類型的完整綜述　　*有向無環(huán)圖和DAGs　　*最小生成樹　　*最短路徑　　*網(wǎng)絡(luò)流程　　*圖表、樣例C代碼和詳細(xì)的算法描述

作者簡(jiǎn)介

Robert Sedgewick是普林頓大學(xué)的計(jì)算機(jī)科學(xué)教授。他是Adobe Systems公司的主管，并曾在施樂的帕洛阿爾托研究中心、美國(guó)國(guó)防防御分析研究所和法國(guó)國(guó)立計(jì)算機(jī)與自動(dòng)化研究所從事研究工作。他從斯坦福大學(xué)獲得了博士學(xué)位。Sedgewick教授還和Philippe Flajolet合著了《An Introdu

書籍目錄

GraphAlgorithmsChapter17.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 ProblemsChapter18.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 AnalysisofGraphAlgorithmsChapter19.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 PerspectiveChapter20.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 MSTChapter21.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 PerspectiveChapter22.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 PerspectiveReferences for Part FiveIndex

圖書封面

圖書標(biāo)簽Tags

無

評(píng)論、評(píng)分、閱讀與下載

---

    算法V PDF格式下載

---