Algorithms in Java, Part 5: Graph Algorithms (3rd Edition) (Pt.5) - Softcover

Sedgewick, Robert

Softcover

ISBN 10: 0201361213 ISBN 13: 9780201361216

Publisher: AddisonWesley Professional, 2003

Synopsis

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.

About this title

Synopsis:

Algorithms in Java, Third Edition, Part 5: Graph Algorithms, contains six chapters that cover graph properties and types, graph search, directed graphs, minimal spanning trees, shortest paths, and networks. The descriptions here are intended to give students an understanding of the basic properties of as broad a range of fundamental graph algorithms as possible. In the third edition, many new algorithms are presented, and the explanations of each algorithm are much more detailed than in previous editions. Unlike any other book on algorithms, not only will students get practical information on using algorithms in their work, they can also be assured that these algorithms rest on the most solid scientific foundations. And a new emphasis on abstract data types throughout the books makes the programs more broadly useful and relevant in modern object-oriented programming environments. This book is useful as a text early in the computer science curriculum, after students have acquired basic programming skills and familiarity with computer systems, but before they have taken specialized courses in advanced areas of computer science or computer applications.There is sufficient coverage of basic material for the book to be used to teach data structures to beginners, and there is sufficient detail and coverage of advanced material for the book to be used to teach the design and analysis of algorithms to upper-level students.

Some instructors may wish to emphasize implementations and practical concerns; others may wish to emphasize analysis and theoretical concepts. For a more comprehensive course, this book is also available in a special bundle with Parts 1-4 (ISBN for bundle of Parts 1-4 and Part 5 is 0201775786); thereby instructors can cover fundamentals, data structures, sorting, searching, and graph algorithms in one consistent style.

About the Author:

Robert Sedgewick is one of the most revered individuals in all of 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 of the algorithms. 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.

About this edition

• Publisher: AddisonWesley Professional
• Publication date: 2003
• ISBN 10: 0201361213
• ISBN 13: 9780201361216
• Binding: Paperback
• Edition number: 3
• Number of pages: 516