Da
BooksRun, Philadelphia, PA, U.S.A.
Valutazione del venditore 5 su 5 stelle
Venditore AbeBooks dal 2 febbraio 2016
Heavy wear. Ship within 24hrs. Satisfaction 100% guaranteed. APO/FPO addresses supported. Codice articolo 0201361183-7-1-13
Defines and explores the implementation and figures of the algorithms required for various applications, offering commentary, descriptions, and exercises for developers, researchers, and students.
Informazioni sull?autore:
Robert Sedgewick is the William O. Baker Professor of Computer Science at Princeton University. He is a Director of Adobe Systems and has served on the research staffs at Xerox PARC, IDA, and INRIA. He earned his Ph.D from Stanford University under Donald E. Knuth.
Titolo: Algorithms in C++ Part 5: Graph Algorithms
Casa editrice: Addison-Wesley Professional (edition 3)
Data di pubblicazione: 2001
Legatura: Paperback
Condizione: Fair
Edizione: 3.
Da: Evergreen Goodwill, Seattle, WA, U.S.A.
paperback. Condizione: Good. Codice articolo mon0000094285
Quantità: 2 disponibili
Da: HPB-Red, Dallas, TX, U.S.A.
paperback. Condizione: Good. Connecting readers with great books since 1972! Used textbooks may not include companion materials such as access codes, etc. May have some wear or writing/highlighting. We ship orders daily and Customer Service is our top priority! Codice articolo S_447271884
Quantità: 1 disponibili
Da: HPB-Red, Dallas, TX, U.S.A.
paperback. Condizione: Acceptable. Connecting readers with great books since 1972. Used textbooks may not include companion materials such as access codes, etc. May have condition issues including wear and notes/highlighting. We ship orders daily and Customer Service is our top priority! Codice articolo S_432017568
Quantità: 1 disponibili
Da: Better World Books, Mishawaka, IN, U.S.A.
Condizione: Very Good. Used book that is in excellent condition. May show signs of wear or have minor defects. Codice articolo 336075-6
Quantità: 1 disponibili
Da: Goodwill of Colorado, COLORADO SPRINGS, CO, U.S.A.
Condizione: good. This item is in overall good condition. Covers and dust jackets are intact but may have minor wear including slight curls or bends to corners as well as cosmetic blemishes including stickers. Pages are intact but may have minor highlighting writing. Binding is intact; however, spine may have slight wear overall. Digital codes may not be included and have not been tested to be redeemable and or active. Minor shelf wear overall. Please note that all items are donated goods and are in used condition. Orders shipped Monday through Friday! Your purchase helps put people to work and learn life skills to reach their full potential. Orders shipped Monday through Friday. Your purchase helps put people to work and learn life skills to reach their full potential. Thank you! Codice articolo 466SGT0034KO
Quantità: 1 disponibili
Da: Phatpocket Limited, Waltham Abbey, HERTS, Regno Unito
Condizione: Good. Your purchase helps support Sri Lankan Children's Charity 'The Rainbow Centre'. Ex-library, so some stamps and wear, but in good overall condition. Our donations to The Rainbow Centre have helped provide an education and a safe haven to hundreds of children who live in appalling conditions. Codice articolo Z1-V-026-02597
Quantità: 1 disponibili
Da: Toscana Books, AUSTIN, TX, U.S.A.
Paperback. Condizione: new. Excellent Condition.Excels in customer satisfaction, prompt replies, and quality checks. Codice articolo Scanned0201361183
Quantità: 1 disponibili
Da: WorldofBooks, Goring-By-Sea, WS, Regno Unito
Paperback. Condizione: Very 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). The book has been read, but is in excellent condition. Pages are intact and not marred by notes or highlighting. The spine remains undamaged. Codice articolo GOR003790851
Quantità: 1 disponibili
Da: Revaluation Books, Exeter, Regno Unito
Paperback. Condizione: Brand New. 3rd edition. 528 pages. 9.00x7.50x0.75 inches. In Stock. Codice articolo 0201361183
Quantità: 1 disponibili
Da: BennettBooksLtd, San Diego, NV, U.S.A.
paperback. Condizione: New. In shrink wrap. Looks like an interesting title! Codice articolo Q-0201361183
Quantità: 1 disponibili