 Trade In this Item for up to £11.30
Get an extra £5 when you trade in books worth £10 or more until June 30, 2012. Trade in Algorithms in Java: Graph Algorithms Pt.5 for an Amazon.co.uk gift card of up to £11.30, which you can then spend on millions of items across the site. Trade-in values may vary (terms apply). Find more products eligible for trade-in.
|
Frequently Bought Together
Product details
|
Product Description
Product Description
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.
From the Back Cover
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 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
Tag this product(What's this?)Think of a tag as a keyword or label you consider is strongly related to this product.
Tags will help all customers organise and find favourite items. |
Sell a Digital Version of This Book in the Kindle Store
What Other Items Do Customers Buy After Viewing This Item?
Customer Reviews
But how does one take advantage of that? Consulting research journals in maths for papers on graph theory is really feasible only for the career mathematician. But for me, graphs are just a tool; not an ends per se. So I need a book that has the right amount of complexity. It needs to get enough into the subject, beyond the trivial exposition of definitions. Yet it should not bury me in lemmas and theorems.
I found such a book! This one. A well deserved third iteration. The explanations are extremely clear. Before I encountered this text, I used Donald Knuth's "Art of Computer Programming" (which is also put out by Addison-Wesley) and his treatment of graphs. But Sedgewick's discourse is far more extensive and, to me, just as well written.
A bonus is the extensive problem sets at the ends of each chapter. Even if I have no inclination to do them, the results they give are a valuable extension of the text, by providing an extra summary of the research. I only wish that Sedgewick would provide answers, like Knuth. But this is a just a quibble.
This edition has example code in Java. Certainly nothing wrong with that. [I program in Java.] But really the code should be a secondary consideration to you. If you are a programmer and you can understand the text, then you should be of a calibre that you can write the code.
As much as I admired the work presented in this text, every masterpiece has its flaws, and this one is no different. Many sections of the text had cryptic descriptions, ambiguous explanations, and fragmented code samples that required time to "reverse-engineer". It is as if the author wants the reader to prove his/her worth before presenting all the hidden gems in this book.
For example, the entire Network Flow chapter is filled with partial code fragments that the reader has to piece together manually. Key details like the Network class and the interface that it exposes, were missing and renders the code samples difficult to dig through. The modified Bellman-Ford algorithm that's used to discover negative cost cycles in residual networks -- the central piece of the puzzle -- was assigned as exercise without solutions. On one hand it served high pedagogical values, on the other it was tedious to work through by yourself without help from an instructor.
In light of that, I'm concerned that other readers might overlook what, in my opinion, may be one of the most comprehensive and well written introductions to graph theory and graph algorithms that there is, and certainly one of the best that I have personally come across thus far.
Recently I took on a project wherein I needed to solve a shortest path problem for a particular kind of graph. I am not a specialist in graph theory and needed practical information that I could utilize immediately. For me, this book fit the bill and was a godsend.
It is true that I already had a practical real world application in mind before I even knew of this book but this book has exceeded both my needs and expectations.
It is easy for me to understand how you may not initially see the practical value of the information being presented, if the sole reason you're studying this book is simply because it is a part of your college curriculum. I think, however, that that does not lessen the value of the book, especially for those of us who do have practical applications for the material.
If you are looking for an informational resource for a real-world problem related to graph theory, you would do well to consider this book.
The book does actually open by citing several practical examples of areas where these algorithms can be applied, although, perhaps the reader who assigned the one star rating may have appreciated and benefited from a case study.
Listmania!
Look for similar items by category
- Books > Computing & Internet > Computer Science > Information Systems
- Books > Computing & Internet > Databases > Database Theory
- Books > Computing & Internet > Databases > Java & Databases
- Books > Computing & Internet > Digital Lifestyle > Online Shopping
- Books > Computing & Internet > Programming > Algorithms > Graph Algorithms
- Books > Computing & Internet > Programming > Algorithms > Java
- Books > Computing & Internet > Programming > Languages > Java
- Books > Health, Family & Lifestyle > Medical & Healthcare Practitioners
Look for similar items by subject
Feedback
- Would you like to update product info or give feedback on images?
- I am the Author, and I want to comment on my book.
- I am the Publisher, and I want to comment on this book.
|
