000			02836nam a22002172 b4500
001			0000045115
003			0001
008			980604e20020816maua s|||||||| 2|eng|d
020			_a0201316633
040			_aBIP US _dWaSeSS
082	0	0	_a005.133 _221
084			_a005.133 _bSED-A
100	1		_aSedgewick, Robert, _eAuthor.
245	1	0	_aAlgorithms in C _h[Book] : _bPart. 5 graph algorithms
250			_a3rd ed.
260			_aBoston : : _bAddision Wesley, _cc2002.
300			_axvii, 482 p. : _bill.
500			_aIncludes index.
520	8		_aAnnotation _b<p style="MARGIN: 0px" align="left" text-align="left">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 with concise implementations that can be tested on real applications, which has made his work popular with programmers for many years.</p><p style="MARGIN: 0px" align="left" text-align="left"><b><i>Algorithms in C, Third Edition, Part 5: Graph Algorithms</i></b>is the second book in Sedgewick's thoroughly revised and rewritten series. The first book,<i>Parts 1-4</i>, 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. A focus on abstract data types makes the programs more broadly useful and relevant for the modern object-oriented programming environment.</p><p style="MARGIN: 0px" align="left" text-align="left">Coverage includes:</p><ul><li>A complete overview of graph properties and types</li><li>Diagraphs and DAGs</li><li>Minimum spanning trees</li><li>Shortest paths</li><li>Network flows</li><li>Diagrams, sample C code, and detailed algorithm descriptions</li></ul><p style="MARGIN: 0px" align="left" text-align="left">The Web site for this book (<a href="http://www.cs.princeton.edu/r̃s/">http://www.cs.princeton.edu/r̃s/</a>) provides additional source code for programmers along with numerous support materials for educators.</p><p style="MARGIN: 0px" align="left" text-align="left">A landmark revision,<i><b>Algorithms in C, Third Edition, Part 5</b></i>provides a complete tool set for programmers to implement, debug, and use graph algorithms across a wide range of computer applications.</p>.
852			_p18543 _93845.00 _vBook Ocean Islamabad _dBooks
999			_c155367 _d155367