|
|
Message from Dean - May 8th 2007
I am currently testing out a new version of the APF Bridge Component - If you notice any errors within this demo store please drop me a line.
List Price: $49.99Amazon.com's Price: $44.99 You Save: $5.00 (10%)Prices subject to change.
Availability: Usually ships in 24 hours
This item ships for FREE with Super Saver Shipping.
Binding: Paperback
Dewey Decimal Number: 004
EAN: 9780201361216
Edition: 3
ISBN: 0201361213
Label: Addison-Wesley Professional
Manufacturer: Addison-Wesley Professional
Number Of Items: 1
Number Of Pages: 528
Publication Date: July 25, 2003
Publisher: Addison-Wesley Professional
Studio: Addison-Wesley Professional
Alternate Versions: Click to Display
Related Items:
Browse for similar items by category:
Editorial Review:
Product Description:
Text provides a tool set for programmers to implement, debug, and use graph algorithms across a wide range of computer applications. Covers graph properties and types; digraphs and DAGs; minimum spanning trees; shortest paths; network flows; and diagrams, sample Java code, and detailed algorithm descriptions. Softcover.
Average Rating: 
Rating:  -
[...]I have at least half of both volumes, and it really seems to me that there are real problems here with the exposition. Let me see if I can elaborate.
Here is an actual sentence from the book-
We construct a symbol table that is made up of an ordered array of keys, except that we keep in that array not the key, but an index into the text string that points to the first character of the key.
Consider that there are two possible conflicting meanings of the sentence fragment :
...an index into the text string that points to the first character of the key.
In the first meaning, there is an index that points to the first character of a string which string has the property that it, in its turn "points to the first character of the key". (a String is engaged in pointing and so in the index.)
In the second meaning, there is an index that points (into) a text string and in fact that index points into the FIRST CHARACTER ... Read More
Rating: -
I give this book 5 stars for everything but the Java code, and 2 stars for the Java -- 4 as a weighted average.
Regarding the code, the authors flout standard Java conventions, which makes reading the Java code tedious for anybody with a lot of Java experience.
Things like uppercase fields and parameter names are only minor annoyances, to be sure, but so is ReAdInG TeXt LiKe ThIs AlSo JuSt A mInOr AnNoYaNcE, and there is no reason to not write code using the conventions of the language you're writing in rather than the conventions of the language your book was first written in or your own arbitrary conventions.
Having said that, I have no other gripes, and the book has much else to commend it.
The prose is very clear and exact. Whenever I found some description or definition confusing, a careful re-reading and consideration of every word included always cleared up my misunderstanding. This is not one of those books with sloppy definitions ... Read More
Rating:  -
Another reviewer gave this book a one star rating citing that the book falls short on practical examples.
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 ... Read More
Rating:  -
I have the dubious distinction of having taken a class that used this book as it's central text. The illustrations are great. The explanations of algorithms and general algorithm design concepts are clear. The code, however, is neigh unreadable in a lot of places.
This was a huge problem for me, as I had a lot of difficulty seeing a clear mapping from the concepts explained to the code examples. Sedgwick's code examples often build on previous ones to the degree that they are not understandable on their own (this is especially true with the graph algorithms in part 5). If you try to use this book as a reference you will find yourself digging much harder than you would like in order to understand code samples that are actually quite simple. You could see how this might make a programming based course difficult.
Rating: -
This is an excellent book. Robert does a great job leading you through the fundamentals of algorithms and algorithm analysis. The visualizations are very well done. In particular the sort algorithm coverage is very well illustrated and described.
The best parts of the book are sorting and searching. A wide variety of algorithms are explained and demonstrated in detail. The code is solid and the writing is very good.
This is the set of Java algorithms books.
Availability: Usually ships in 24 hours
|
Amazon Store 