| 作者 |
| Robert Sedgewick |
| 丛书名 |
| 经典原版书库 |
| 出版社 |
| 机械工业出版社 |
| ISBN |
| 9782106241544 |
| 简要 |
| 简介 |
| 内容简介书籍计算机书籍 ---------------------------32062 - 算法：C语言实现（第5部分）：图算法（英文影印版·第3版）[图书]--------------------------- 本书是Sedgewick彻底修订和重写的C算法系列的第二本，集中讲解图算法。全书共有6章(第17～22章)。第17章详细讨论图性质和类型，第18～22章分别讲解图搜索、有向图和DAG、最小生成树、最短路径以及网络流。. 书中提供了用C语言描述的完整算法源程序，并且配有丰富的插图和练习。作者用简洁的实现将理论和实践成功地结合了起来，这些实现均可在真实应用上测试，使得本书自问世以来备受程序员的欢迎。.. 本书可作为高等院校计算机相关专业算法与数据结构课程的教材和补充读物，也可供自学之用。 本书作者的网站http：//www．cs．princeton．edu/～rs/为程序员提供了本书的源代码和勘误表。... ---------------------------32151 - 算法：C语言实现（第1～4部分）：基础知识、数据结构、排序及搜索（英文影印版·第3版）[图书]--------------------------- 本书是Sedgewick彻底修订和重写的C算法系列的第一本。全书分为四部分，共16章。第一部分“基础知识” (第1-2章) 介绍基本算法分析原理。第二部分“数据结构” (第3-5章) 讲解算法分析中必须掌握的数据结构知识，主要包括基本数据结构、抽象数据结构、递归和树。第三部分“排序” (第6-11章) 按章节顺序分别讨论基本排序方法 (如选择排序、插入排序、冒泡排序、希尔排序等) 、快速排序方法、归并和归并排序方法、优先队列与堆排序方法、基数排序方法以及特殊目的排序方法，并比较了各种排序方法的性能特征。第四部分“搜索” (第12-16章) 在进一步讲解符号表、树等抽象数据类型的基础上，重点讨论哈希方法、基数搜索以及外部搜索方法。. . 书中提供了用C语言描述的完整算法源程序，并且配有丰富的插图和练习。作者用简洁的实现将理论和实践成功地结合了起来，这些实现均可在真实应用上测试，使得本书自问世以来备受程序员的欢迎。... |
| 目录 |
| [套装书具体书目] 32062 - 算法：C语言实现（第5部分）：图算法（英文影印版·第3版）[图书] - 9787111197690 - 机械工业出版社 - 定价 49 32151 - 算法：C语言实现（第1～4部分）：基础知识、数据结构、排序及搜索（英文影印版·第3版）[图书] - 9787111197645 - 机械工业出版社 - 定价 69 ---------------------------32062 - 算法：C语言实现（第5部分）：图算法（英文影印版·第3版）[图书]--------------------------- 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 Functions 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 Oraers 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 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 ... ---------------------------32151 - 算法：C语言实现（第1～4部分）：基础知识、数据结构、排序及搜索（英文影印版·第3版）[图书]--------------------------- Chapter1.Introduction. 1.1Algorithms 1.2ASampleProblem--Connectivity 1.3Union-FindAlgorithms 1.4Perspective 1.5SummaryofTopics Chapter2.PrinciplesofAlgorithmAnalysis 2.1ImplementationandEmpiricalAnalysis 2.2AnalysisofAlgorithms 2.3GrowthofFunctions 2.4Big-Ohnotation 2.5BasicRecurrences 2.6ExamplesofAlgorithmAnalysis 2.7Guarantees,Predictions,andLimitations Chapter3.ElementaryDataStructures 3.1BuildingBlocks 3.2Arrays 3.3LinkedLists 3.4ElementaryListProcessing 3.5MemoryAllocationforLists 3.6Strings 3.7CompoundDataStructures Chapter4.AbstractDataTypes 4.1AbstractObjectsandCollectionsofObjects 4.2PushdownStackADT 4.3ExamplesofStackADTClients 4.4StackADTImplementations 4.5CreationofaNewADT 4.6FIFOQueuesandGeneralizedQueues 4.7DuplicateandIndexItems 4.8First-ClassADTs 4.9Application-BasedADTExample 4.10Perspective Chapter5.RecursionandTrees 5.1RecursiveAlgorithms 5.2DivideandConquer 5.3DynamicProgramming 5.4Trees 5.5MathematicalPropertiesofTrees 5.6TreeTraversal 5.7RecursiveBinary-TreeAlgorithms 5.8GraphTraversal 5.9Perspective Chapter6.ElementarySortingMethods 6.1RulesoftheGame 6.2SelectionSort 6.3InsertionSort 6.4BubbleSort 6.5PerformanceCharacteristicsofElementarySorts 6.6She!lsort 6.7SortingOtherTypesofData 6.8IndexandPointerSorting 6.9SortingofLinkedLists 6.10Key-IndexedCounting Chapter7.Quicksort 7.1TheBasicAlgorithm 7.2PerformanceCharacteristicsofQuicksort 7.3StackSize 7.4SmallSubfiles 7.5Median-of-ThreePartitioning 7.6DuplicateKeys 7.7StringsandVectors 7.8Selection Chapter8.MergingandMergesort 8.1Two-WayMerging 8.2AbstractIn-placeMerge 8.3Top-DownMergesort 8.4ImprovementstotheBasicAlgorithm 8.5Bottom-UpMergesort 8.6PerformanceCharacteristicsofMergesort.. 8.7Linked-ListImplementationsofMergesort 8.8RecursionRevisited Chapter9.PriorityQueuesandHeapsort 9.1ElementaryImplementations 9.2HeapDataStructure 9.3AlgorithmsonHeaps 9.4Heapsort 9.5Priority-QueueADT 9.6PriorityQueuesforIndexItems 9.7BinomialQueues Chapter10.RadixSorting 10.1Bits,Bytes,andWords 10.2BinaryQuicksort 10.3MSDRadixSort 10.4Three-WayRadixQuicksoft 10.5LSDRadixSort. 10.6PerformanceCharacteristicsofRadixSorts 10.7Sublinear-TimeSorts Chapter11.Special-PurposeSorts 11.1Batcher'sOdd-EvenMergesort 11.2SortingNetworks 11.3ExternalSorting 11.4Sort-MergeImplementations 11.5ParallelSort/Merge Searching Chapter12.SymbolTablesandBSTs 12.1Symbol-TableAbstractDataType 12.2Key4ndexedSearch 12.3SequentialSearch 12.4BinarySearch 12.5BinarySearchTrees(BSTs) 12.6PerformanceCharacteristicsofBSTs 12.7IndexImplementationswithSymbolTables 12.8InsertionattheRootinBSTs 12.9BSTImplementationsofOtherADTFunctions Chapter13.BalancedTrees 13.1RandomizedBSTs 13.2SplayBSTs 13.3Top-Down2-34Trees 13.4Red-BlackTrees 13.5SkipLists 13.6PerformanceCharacteristics Chapter14.Hashing 14.1HashFunctions 14.2SeparateChaining 14.3LinearProbing 14.4DoubleHashing 14.5DynamicHashTables 14.6Perspective Chapter15.RadixSearch 15.1DigitalSearchTrees 15.2Tries 15.3PatriciaTries 15.4MultiwayTriesandTSTs 15.5TextStringIndexAlgorithms Chapter16.ExternalSearching 16.1RulesoftheGame 16.2IndexedSequentialAccess 16.3BTrees 16.4ExtendibleHashing 16.5Perspective... |