Isbn: 9780201361186 - algorithms in c++: graph algorithms (15 risultati)

paperback. Condizione: Good.

Condizione: very_good.

Condizione: acceptable. Used - Acceptable: All pages and the cover are intact, but shrink wrap, dust covers, or boxed set case may be missing. Pages may include limited notes, highlighting, or minor water damage but the text is readable. Pages may include limited notes and highlighting, but the text cannot be obscured or unreadable. Any access codes or passwords originally included with the book may be expired, used or no longer valid. Image is stock photo and cover art edition may be different than pictured.…

Paperback. Condizione: Very Good. No Jacket. May have limited writing in cover pages. Pages are unmarked. ~ ThriftBooks: Read More, Spend Less.

Paperback. Condizione: Fair. No Jacket. Readable copy. Pages may have considerable notes/highlighting. ~ ThriftBooks: Read More, Spend Less.

Paperback. Condizione: Good. No Jacket. Former library book; Pages can have notes/highlighting. Spine may show signs of wear. ~ ThriftBooks: Read More, Spend Less.

Condizione: Good. Item in good condition. Textbooks may not include supplemental items i.e. CDs, access codes etc.

Paperback. Condizione: Good. Graph algorithms are critical for a wide range of applications, including network connectivity, circuit design, scheduling, transaction processing, and resource allocation. The latest in Robert Sedgewick's classic series on algorithms, this is the field's definitive guide to graph algorithms for C++. Far more than a "revision," this is a thorough rewriting, five times as long as the previous edition, with a new text design, innovative new figures, more detailed descriptions, and many new exercises -- all designed to dramatically enhance the book's value to developers, students, and researchers alike. The book contains six chapters covering graph properties and types, graph search, directed graphs, minimal spanning trees, shortest paths, and networks -- each with diagrams, sample code, and detailed descriptions intended to help readers understand the basic properties of as broad a range of fundamental graph algorithms as possible. The basic properties of these algorithms are developed from first principles; discussion of advanced mathematical concepts is brief, general, and descriptive, but proofs are rigorous and many open problems are discussed. Sedgewick focuses on practical applications, giving readers all the information and real (not pseudo-) code they need to confidently implement, debug, and use the algorithms he covers. (Also available: Algorithms in C++: Parts 1-4, Third Edition, ISBN: 0-201-35088-2).…

Condizione: good. Supports Goodwill of Silicon Valley job training programs. The cover and pages are in Good condition! Any other included accessories are also in Good condition showing use. Use can include some highlighting and writing, page and cover creases as well as other types visible wear.

Paperback. Condizione: Very Good. 3. It's a well-cared-for item that has seen limited use. The item may show minor signs of wear. All the text is legible, with all pages included. It may have slight markings and/or highlighting.

paperback. Condizione: As New.

Paperback. Condizione: new. New Copy. Customer Service Guaranteed.

paperback. Condizione: New. Softcover.

paperback. Condizione: New. In shrink wrap. Looks like an interesting title.

Paperback. Condizione: Brand New. 3rd edition. 528 pages. 9.00x7.50x0.75 inches. In Stock.