03571    a2200205   4500003000500000005001700005010001600022020001500038040000900053082001200062100002300074245005100097250001200148260004400160300003400204505303300238650002503271650003703296651003203333Nust20170207154017.0  a   98025050  a0201361205  cNust00a005.1331 aSedgewick, Robert,10aAlgorithms in Java (E-BOOK)cRobert Sedgewick.  a3rd ed.  aBoston :bAddison-Wesley,cc2003-<2004>  av. <1-2   > :bill. ;c24 cm.1 a Preface           Algorithms           Scope           Use in the Curriculum           Algorithms of Practical Use           Programming Language           Acknowledgments           Java Consultant's Preface        Notes on Exercises        Part V:  Graph Algorithms             Chapter 17.  Graph Properties and Types           Section 17.1.  Glossary           Section 17.2.  Graph ADT           Section 17.3.  Adjacency-Matrix Representation           Section 17.4.  Adjacency-Lists Representation           Section 17.5.  Variations, Extensions, and Costs           Section 17.6.  Graph Generators           Section 17.7.  Simple, Euler, and Hamilton Paths           Section 17.8.  Graph-Processing Problems                Chapter 18.  Graph Search           Section 18.1.  Exploring a Maze           Section 18.2.  Depth-First Search           Section 18.3.  Graph-Search ADT Methods           Section 18.4.  Properties of DFS Forests           Section 18.5.  DFS Algorithms           Section 18.6.  Separability and Biconnectivity           Section 18.7.  Breadth-First Search           Section 18.8.  Generalized Graph Search           Section 18.9.  Analysis of Graph Algorithms                Chapter 19.  Digraphs and DAGs           Exercises           Section 19.1.  Glossary and Rules of the Game           Section 19.2.  Anatomy of DFS in Digraphs           Section 19.3.  Reachability and Transitive Closure           Section 19.4.  Equivalence Relations and Partial Orders           Section 19.5.  DAGs           Section 19.6.  Topological Sorting           Section 19.7.  Reachability in DAGs           Section 19.8.  Strong Components in Digraphs           Section 19.9.  Transitive Closure Revisited           Section 19.10.  Perspective                Chapter 20.  Minimum Spanning Trees           Exercises           Section 20.1.  Representations           Section 20.2.  Underlying Principles of MST Algorithms           Section 20.3.  Prim's Algorithm and Priority-First Search           Section 20.4.  Kruskal's Algorithm           Section 20.5.  Boruvka's Algorithm           Section 20.6.  Comparisons and Improvements           Section 20.7.  Euclidean MST                Chapter 21.  Shortest Paths           Exercises           Section 21.1.  Underlying Principles           Section 21.2.  Dijkstra's Algorithm           Section 21.3.  All-Pairs Shortest Paths           Section 21.4.  Shortest Paths in Acyclic Networks           Section 21.5.  Euclidean Networks           Section 21.6.  Reduction           Section 21.7.  Negative Weights           Section 21.8.  Perspective                Chapter 22.  Network Flow           Section 22.1.  Flow Networks           Section 22.2.  Augmenting-Path Maxflow Algorithms           Section 22.3.  Preflow-Push Maxflow Algorithms           Section 22.4.  Maxflow Reductions           Section 22.5.  Mincost Flows           Section 22.6.  Network Simplex Algorithm           Section 22.7.  Mincost-Flow Reductions           Section 22.8.  Perspective    0aComputer algorithms. 0aJava (Computer program language)  aAlgorithms in Java (E-BOOK)