Signed Edition Sweepstakes
 
 

Recently Viewed clear list


Original Essays | September 30, 2014

Brian Doyle: IMG The Rude Burl of Our Masks



One day when I was 12 years old and setting off on my newspaper route after school my mom said will you stop at the doctor's and pick up something... Continue »
  1. $13.27 Sale Trade Paper add to wish list

    Children and Other Wild Animals

    Brian Doyle 9780870717543

spacer
Qualifying orders ship free.
$61.25
New Trade Paper
Ships in 1 to 3 days
Add to Wishlist
available for shipping or prepaid pickup only
Available for In-store Pickup
in 7 to 12 days
Qty Store Section
2 Remote Warehouse Computer Languages- C++

Other titles in the Algorithms in C++ series:

Algorithms in C++ 3RD Edition Part 5

by

Algorithms in C++ 3RD Edition Part 5 Cover

 

Synopses & Reviews

Publisher Comments:

Once again, Robert Sedgewick provides a current and comprehensive introduction to important algorithms. The focus this time is on graph algorithms, which are increasingly critical for a wide range of applications, such as network connectivity, circuit design, scheduling, transaction processing, and resource allocation. In this book, Sedgewick offers the same successful blend of theory and practice that has made his work popular with programmers for many years. Christopher van Wyk and Sedgewick have developed concise new C++ implementations that both express the methods in a natural and direct manner and also can be used in real applications.

Algorithms in C++, Third Edition, Part 5: Graph Algorithms is the second book in Sedgewick's thoroughly revised and rewritten series. The first book, Parts 1-4, addresses fundamental algorithms, data structures, sorting, and searching. A forthcoming third book will focus on strings, geometry, and a range of advanced algorithms. Each book's expanded coverage features new algorithms and implementations, enhanced descriptions and diagrams, and a wealth of new exercises for polishing skills. A focus on abstract data types makes the programs more broadly useful and relevant for the modern object-oriented programming environment.

Coverage includes:

  • A complete overview of graph properties and types
  • Diagraphs and DAGs
  • Minimum spanning trees
  • Shortest paths
  • Network flows
  • Diagrams, sample C++ code, and detailed algorithm descriptions

The Web site for this book (http://www.cs.princeton.edu/~rs/) provides additional source code for programmers along with a wide range of academic support materials for educators.

A landmark revision, Algorithms in C++, Third Edition, Part 5 provides a complete tool set for programmers to implement, debug, and use graph algorithms across a wide range of computer applications.

0201361183B11282001

Book News Annotation:

Describes the most important known methods for solving the graph processing problems that arise in computing applications. The algorithms address diagraphs, minimum spanning trees, shortest paths, and network flow. A new emphasis on abstract data types makes the third edition more relevant to object-oriented programming.
Annotation c. Book News, Inc., Portland, OR (booknews.com)

Synopsis:

Software developers and computer scientists have eagerly awaited this comprehensive revision of Robert Sedgewick's landmark texts on algorithms for C++. Sedgewick has completely revamped all five sections, illuminating today's best algorithms for an exceptionally wide range of tasks. This shrink-wrapped package brings together Algorithms in C++, Third Edition, Parts 1-4 and his new Algorithms in C++, Third Edition, Part 5, at a special discounted price. Together, these books are the most definitive, up-to-date, and practical algorithms resource available. The first book introduces fundamental concepts associated with algorithms, then covers data structures, sorting, and searching. The second book focuses entirely on graphing algorithms, which are critical for a wide range of applications, including network connectivity, circuit design, scheduling, transaction processing, and resource allocation. Sedgewick focuses on practical applications, giving readers all the information, diagrams, and real (not pseudo-) code they need to confidently implement, debug, and use the algorithms he presents. Together these books present nearly 2,000 new exercises, hundreds of new figures, and dozens of new programs.

020172684XB07112001

About the Author

Robert Sedgewick is the William O. Baker Professor of Computer Science at Princeton University. He is a Director of Adobe Systems and has served on the research staffs at Xerox PARC, IDA, and INRIA. He earned his Ph.D from Stanford University under Donald E. Knuth.

020172684XAB06262002

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. 0201361183T12172001

Product Details

ISBN:
9780201361186
Author:
Sedgewick, Robert
Publisher:
Addison-Wesley Professional
Subject:
Computer Science
Subject:
Programming Languages - C
Subject:
Programming Languages - General
Subject:
C (computer program language)
Subject:
Programming - Algorithms
Subject:
Graph algorithms
Subject:
Computer Languages-C++
Copyright:
Edition Number:
3
Edition Description:
Trade paper
Publication Date:
December 2001
Binding:
TRADE PAPER
Grade Level:
Professional and scholarly
Language:
English
Pages:
1200
Dimensions:
9.4 x 7.9 x 2.3 in 2177 gr

Other books you might like

  1. Algorithms in C++ 3RD Edition Parts 1-4 Used Trade Paper $19.95
  2. Symmetry in Mechanics New Trade Paper $61.25
  3. Sweet Miniatures: The Art of Making... Used Trade Paper $6.50
  4. Comet's Nine Lives Used Pamphlet $1.00
  5. Mobile Robotics: A Practical... New Trade Paper $108.50

Related Subjects

Computers and Internet » Computer Languages » C++
Computers and Internet » Computers Reference » General
Computers and Internet » Personal Computers » General
Computers and Internet » Software Engineering » Algorithms

Algorithms in C++ 3RD Edition Part 5 New Trade Paper
0 stars - 0 reviews
$61.25 In Stock
Product details 1200 pages Addison-Wesley Professional - English 9780201361186 Reviews:
"Synopsis" by , Software developers and computer scientists have eagerly awaited this comprehensive revision of Robert Sedgewick's landmark texts on algorithms for C++. Sedgewick has completely revamped all five sections, illuminating today's best algorithms for an exceptionally wide range of tasks. This shrink-wrapped package brings together Algorithms in C++, Third Edition, Parts 1-4 and his new Algorithms in C++, Third Edition, Part 5, at a special discounted price. Together, these books are the most definitive, up-to-date, and practical algorithms resource available. The first book introduces fundamental concepts associated with algorithms, then covers data structures, sorting, and searching. The second book focuses entirely on graphing algorithms, which are critical for a wide range of applications, including network connectivity, circuit design, scheduling, transaction processing, and resource allocation. Sedgewick focuses on practical applications, giving readers all the information, diagrams, and real (not pseudo-) code they need to confidently implement, debug, and use the algorithms he presents. Together these books present nearly 2,000 new exercises, hundreds of new figures, and dozens of new programs.

020172684XB07112001

spacer
spacer
  • back to top
Follow us on...




Powell's City of Books is an independent bookstore in Portland, Oregon, that fills a whole city block with more than a million new, used, and out of print books. Shop those shelves — plus literally millions more books, DVDs, and gifts — here at Powells.com.