Algorithms in C++ Part 5: Graph Algorithms, 3/e (Paperback)

Robert Sedgewick

買這商品的人也買了...

相關主題

商品描述

Description

 

Graph algorithms are critical for a wide range of applications, including network connectivity, circuit design, scheduling, transaction processing, and resource allocation. The latest in Robert Sedgewick's classic series on algorithms, this is the field's definitive guide to graph algorithms for C++. Far more than a "revision," this is a thorough rewriting, five times as long as the previous edition, with a new text design, innovative new figures, more detailed descriptions, and many new exercises -- all designed to dramatically enhance the book's value to developers, students, and researchers alike.KEY TOPICS:The book contains six chapters covering graph properties and types, graph search, directed graphs, minimal spanning trees, shortest paths, and networks -- each with diagrams, sample code, and detailed descriptions intended to help readers understand the basic properties of as broad a range of fundamental graph algorithms as possible. The basic properties of these algorithms are developed from first principles; discussion of advanced mathematical concepts is brief, general, and descriptive, but proofs are rigorous and many open problems are discussed. Sedgewick focuses on practical applications, giving readers all the information and real (not pseudo-) code they need to confidently implement, debug, and use the algorithms he covers. (Also available: Algorithms in C++: Parts 1-4, Third Edition, ISBN: 0-201-35088-2).MARKET:For all software developers, researchers, and students of computer science.

 

Table of Contents

17. Graph Properties and Types.

 

Glossary.

 

 

Graph ADT.

 

 

Adjacency-Matrix Representation.

 

 

Adjacency-Lists Representation.

 

 

Variations, Extensions, and Costs.

 

 

Graph Generators.

 

 

Simple, Euler, and Hamilton Paths.

 

 

Graph-Processing Problems.

 



18. Graph Search.

 

Exploring a Maze.

 

 

Depth-First Search.

 

 

Graph-Search ADT Functions.

 

 

Properties of DFS Forests.

 

 

DFS Algorithms.

 

 

Separability and Biconnectivity.

 

 

Breadth-First Search.

 

 

Generalized Graph Search.

 

 

Analysis of Graph Algorithms.

 



19. Digraphs and DAGs.

 

Glossary and Rules of the Game.

 

 

Anatomy of DFS in Digraphs.

 

 

Reachability and Transitive Closure.

 

 

Equivalence Relations and Partial Orders.

 

 

DAGs.

 

 

Topological Sorting.

 

 

Reachability in DAGs.

 

 

Strong Components in Digraphs.

 

 

Transitive Closure Revisited.

 

 

Perspective.

 



20. Minimum Spanning Trees.

 

Representations.

 

 

Underlying Principles of MST Algorithms.

 

 

Prim's Algorithm and Priority-First Search.

 

 

Kruskal's Algorithm.

 

 

Boruvka's Algorithm.

 

 

Comparisons and Improvements.

 

 

Euclidean MST.

 



21. Shortest Paths.

 

Underlying Principles.

 

 

Dijkstra's algorithm.

 

 

All-Pairs Shortest Paths.

 

 

Shortest Paths in Acyclic Networks.

 

 

Euclidean Networks.

 

 

Reduction.

 

 

Negative Weights.

 

 

Perspective.

 



22. Network Flow.

 

Flow Networks.

 

 

Augmenting-Path Maxflow Algorithms.

 

 

Preflow-Push Maxflow Algorithms.

 

 

Maxflow Reductions.

 

 

Mincost Flows.

 

 

Network Simplex Algorithm.

 

 

Mincost-Flow Reductions.

 

 

Perspective.

 



References for Part Five.


Index.

 

商品描述(中文翻譯)

Description

 


圖形演算法對於各種應用非常重要,包括網路連通性、電路設計、排程、交易處理和資源分配等。這本書是羅伯特·塞奇威克(Robert Sedgewick)經典系列演算法的最新作品,是該領域對於 C++ 圖形演算法的權威指南。這本書不僅僅是一個「修訂版」,它是一個全面的重寫,比上一版長五倍,具有新的文字設計、創新的圖片、更詳細的描述和許多新的練習題,旨在大幅提升對開發人員、學生和研究人員的價值。

主要內容:本書包含六個章節,涵蓋圖形的屬性和類型、圖形搜索、有向圖、最小生成樹、最短路徑和網路等,每個章節都有圖表、示例代碼和詳細描述,旨在幫助讀者了解盡可能廣泛的基本圖形演算法的基本特性。這些演算法的基本特性是從基本原理開發出來的;對於高級數學概念的討論是簡短、通用和描述性的,但證明是嚴謹的,並且討論了許多開放問題。塞奇威克專注於實際應用,為讀者提供了所有所需的信息和真實(而非虛擬)代碼,以便自信地實現、調試和使用他所涵蓋的演算法。(還有:《C++演算法:第1-4部分,第3版,ISBN:0-201-35088-2》)。

市場:適用於所有軟體開發人員、研究人員和計算機科學學生。


 

目錄


17. 圖形的屬性和類型。

 

詞彙表。

 

 

圖形 ADT。

 

 

鄰接矩陣表示法。

 

 

鄰接表表示法。

 

 

變異、擴展和成本。

 

 

圖形生成器。

 

 

簡單、歐拉和漢密爾頓路徑。

 

 

圖形處理問題。

 





18. 圖形搜索。

 

探索迷宮。

 

 

深度優先搜索。

 

 

圖形搜索 ADT 函數。

 

 

DFS 森林的特性。