The Fictioning
 
 

Special Offers see all

Enter to WIN a $100 Credit

Subscribe to PowellsBooks.news
for a chance to win.
Privacy Policy

Tour our stores


    Recently Viewed clear list


    Original Essays | September 17, 2014

    Merritt Tierce: IMG Has My Husband Read It?



    My first novel, Love Me Back, was published on September 16. Writing the book took seven years, and along the way three chapters were published in... Continue »

    spacer
Qualifying orders ship free.
$25.00
Used Trade Paper
Ships in 1 to 3 days
Add to Wishlist
Qty Store Section
1 Burnside Computer Languages- Java

Other titles in the Algorithms in Java series:

Algorithms in Java 3RD Edition Part 5 Graph Algo

by

Algorithms in Java 3RD Edition Part 5 Graph Algo 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. Michael Schidlowsky and Sedgewick have developed concise new Java implementations that both express the methods in a natural and direct manner and also can be used in real applications.

Algorithms in Java, 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. The natural match between Java classes and abstract data type (ADT) implementations makes the code more broadly useful and relevant for the modern object-oriented programming environment.

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

Coverage includes:

  • A complete overview of graph properties and types
  • Diagraphs and DAGs
  • Minimum spanning trees
  • Shortest paths
  • Network flows
  • Diagrams, sample Java code, and detailed algorithm descriptions
  • A landmark revision, Algorithms in Java, 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.

    0201361213B06272003

    Synopsis:

    Part 5 of Sedgewick's seminal work on Algorithms is available for the first time in a Java version!
    - Part 5 of the most important work on computer algorithms, completely revised, greatly expanded, and completely up-to-date.
    - Its unique blend of theory and practice makes this book appeal equally to both the professional and academic markets.
    - Over 400,000 copies of Sedgewick's books on algorithms have been sold! This edition is long-awaited, with lots of pent-up demand.

    About the Author

    Robert Sedgewick is one of the most revered individuals in computer science. He is the William O. Baker Professor of Computer Science at Princeton University. He is a director of Adobe Systems and has held visiting research positions at INRIA, the Institute for Defense Analyses, and Xerox PARC. Michael Schidlowsky contributed to the Java implementations. Michael, a Princeton graduate, is an independent software consultant specializing in object-oriented programming. Most recently he was the CTO of Teaching That Works, and the founder of xSense Corporation.

    Table of Contents

    PART V. GRAPH ALGORITHMS.
    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.

    Product Details

    ISBN:
    9780201361216
    With:
    Schidlowsky, Michael
    Publisher:
    Addison-Wesley Professional
    With:
    Schidlowsky, Michael
    Author:
    Sedgewick, Robert
    Subject:
    General
    Subject:
    Computer Science
    Subject:
    Programming - General
    Subject:
    Java (Computer program language)
    Subject:
    Algorithms
    Subject:
    Computer algorithms
    Subject:
    Personal Computers-General
    Copyright:
    Edition Number:
    3
    Edition Description:
    Trade paper
    Series:
    Algorithms in Java
    Series Volume:
    5-8
    Publication Date:
    July 2003
    Binding:
    TRADE PAPER
    Grade Level:
    Professional and scholarly
    Language:
    English
    Illustrations:
    Y
    Pages:
    1200
    Dimensions:
    9.5 x 8 x 2 in 2041 gr

    Other books you might like

    1. Psalm Twenty-Three New Trade Paper $8.00
    2. Feast for 10 New Board Book $4.95
    3. Sarny: A Life Remembered Used Mass Market $3.50
    4. The Lord's Prayer New Trade Paper $8.50
    5. There Was an Old Lady Who Swallowed... Used Hardcover $10.00
    6. Dreamland
      Used Trade Paper $2.95

    Related Subjects

    Computers and Internet » Computer Languages » Java
    Computers and Internet » Computers Reference » General
    Computers and Internet » Personal Computers » General
    Computers and Internet » Software Engineering » Programming and Languages
    Health and Self-Help » Health and Medicine » General
    Health and Self-Help » Health and Medicine » General Medicine

    Algorithms in Java 3RD Edition Part 5 Graph Algo Used Trade Paper
    0 stars - 0 reviews
    $25.00 In Stock
    Product details 1200 pages Addison-Wesley Professional - English 9780201361216 Reviews:
    "Synopsis" by , Part 5 of Sedgewick's seminal work on Algorithms is available for the first time in a Java version!
    - Part 5 of the most important work on computer algorithms, completely revised, greatly expanded, and completely up-to-date.
    - Its unique blend of theory and practice makes this book appeal equally to both the professional and academic markets.
    - Over 400,000 copies of Sedgewick's books on algorithms have been sold! This edition is long-awaited, with lots of pent-up demand.
    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.