Algorithms in Java, Part 5; Robert Sedgewick; 2003

1 säljare

Algorithms in Java, Part 5 Upplaga 3

Name: Algorithms in Java, Part 5
Brand: Pearson Education
SKU: 711140
Availability: InStock
ISBN: 9780201361216

av Robert Sedgewick

PART V. GRAPH ALGORITHMS.

17. Graph Properties and Types.

Glossary.

Graph ADT.

Adjacency-Matrix Representation.

Adjacency-Lists Representation.

Variations, Extensions, and Costs.

Graph Generators.

Simple, Euler, and Hamilton Paths.

Graph-Processing Problems.

18. Graph Search.

Exploring a Maze.

Depth-First Search.

Graph-Search ADT Functions.

Properties of DFS Forests.

DFS Algorithms.

Separability and Biconnectivity.

Breadth-First Search.

Generalized Graph Search.

Analysis of Graph Algorithms.

19. Digraphs and DAGs.

Glossary and Rules of the Game.

Anatomy of DFS in Digraphs.

Reachability and Transitive Closure.

Equivalence Relations and Partial Orders.

DAGs.

Topological Sorting.

Reachability in DAGs.

Strong Components in Digraphs.

Transitive Closure Revisited.

Perspective.

20. Minimum Spanning Trees.

Representations.

Underlying Principles of MST Algorithms.

Prim's Algorithm and Priority-First Search.

Kruskal's Algorithm.

Boruvka's Algorithm.

Comparisons and Improvements.

Euclidean MST.

21. Shortest Paths.

Underlying Principles.

Dijkstra's Algorithm.

All-Pairs Shortest Paths.

Shortest Paths in Acyclic Networks.

Euclidean Networks.

Reduction.

Negative Weights.

Perspective.

22. Network Flow.

Flow Networks.

Augmenting-Path Maxflow Algorithms.

Preflow-Push Maxflow Algorithms.

Maxflow Reductions.

Mincost Flows.

Network Simplex Algorithm.

Mincost-Flow Reductions.

Perspective.

References for Part Five.

Index.

PART V. GRAPH ALGORITHMS.

17. Graph Properties and Types.

Glossary.

Graph ADT.

Adjacency-Matrix Representation.

Adjacency-Lists Representation.

Variations, Extensions, and Costs.

Graph Generators.

Simple, Euler, and Hamilton Paths.

Graph-Processing Problems.

18. Graph Search.

Exploring a Maze.

Depth-First Search.

Graph-Search ADT Functions.

Properties of DFS Forests.

DFS Algorithms.

Separability and Biconnectivity.

Breadth-First Search.

Generalized Graph Search.

Analysis of Graph Algorithms.

19. Digraphs and DAGs.

Glossary and Rules of the Game.

Anatomy of DFS in Digraphs.

Reachability and Transitive Closure.

Equivalence Relations and Partial Orders.

DAGs.

Topological Sorting.

Reachability in DAGs.

Strong Components in Digraphs.

Transitive Closure Revisited.

Perspective.

20. Minimum Spanning Trees.

Representations.

Underlying Principles of MST Algorithms.

Prim's Algorithm and Priority-First Search.

Kruskal's Algorithm.

Boruvka's Algorithm.

Comparisons and Improvements.

Euclidean MST.

21. Shortest Paths.

Underlying Principles.

Dijkstra's Algorithm.

All-Pairs Shortest Paths.

Shortest Paths in Acyclic Networks.

Euclidean Networks.

Reduction.

Negative Weights.

Perspective.

22. Network Flow.

Flow Networks.

Augmenting-Path Maxflow Algorithms.

Preflow-Push Maxflow Algorithms.

Maxflow Reductions.

Mincost Flows.

Network Simplex Algorithm.

Mincost-Flow Reductions.

Perspective.

References for Part Five.

Index.

Upplaga: 3e upplagan

Utgiven: 2003

ISBN: 9780201361216

Förlag: Pearson Education

Format: Bok

Språk: Engelska

Sidor: 528 st

PART V. GRAPH ALGORITHMS.

17. Graph Properties and Types.

Glossary.

Graph ADT.

Adjacency-Matrix Representation.

Adjacency-Lists Representation.

Variations, Extensions, and Costs.

Graph Generators.

Simple, Euler, and Hamilton Paths.

Graph-Processing Problems.

18. Graph Search.

Exploring a Maze.

Depth-First Search.

Graph-Search ADT Functions.

Properties of DFS Forests.

DFS Algorithms.

Separability and Biconnectivity.

Breadth-First Search.

Generalized Graph Search.

Analysis of Graph Algorithms.

19. Digraphs and DAGs.

Glossary and Rules of the Game.

Anatomy of DFS in Digraphs.

Reachability and Transitive Closure.

Equivalence Relations and Partial Orders.

DAGs.

Topological Sorting.

Reachability in DAGs.

Strong Components in Digraphs.

Transitive Closure Revisited.

Perspective.

20. Minimum Spanning Trees.

Representations.

Underlying Principles of MST Algorithms.

Prim's Algorithm and Priority-First Search.

Kruskal's Algorithm.

Boruvka's Algorithm.

Comparisons and Improvements.

Euclidean MST.

21. Shortest Paths.

Underlying Principles.

Dijkstra's Algorithm.

All-Pairs Shortest Paths.

Shortest Paths in Acyclic Networks.

Euclidean Networks.

Reduction.

Negative Weights.

Perspective.

22. Network Flow.

Flow Networks.

Augmenting-Path Maxflow Algorithms.

Preflow-Push Maxflow Algorithms.

Maxflow Reductions.

Mincost Flows.

Network Simplex Algorithm.

Mincost-Flow Reductions.

Perspective.

References for Part Five.

Index.

PART V. GRAPH ALGORITHMS.

17. Graph Properties and Types.

Glossary.

Graph ADT.

Adjacency-Matrix Representation.

Adjacency-Lists Representation.

Variations, Extensions, and Costs.

Graph Generators.

Simple, Euler, and Hamilton Paths.

Graph-Processing Problems.

18. Graph Search.

Exploring a Maze.

Depth-First Search.

Graph-Search ADT Functions.

Properties of DFS Forests.

DFS Algorithms.

Separability and Biconnectivity.

Breadth-First Search.

Generalized Graph Search.

Analysis of Graph Algorithms.

19. Digraphs and DAGs.

Glossary and Rules of the Game.

Anatomy of DFS in Digraphs.

Reachability and Transitive Closure.

Equivalence Relations and Partial Orders.

DAGs.

Topological Sorting.

Reachability in DAGs.

Strong Components in Digraphs.

Transitive Closure Revisited.

Perspective.

20. Minimum Spanning Trees.

Representations.

Underlying Principles of MST Algorithms.

Prim's Algorithm and Priority-First Search.

Kruskal's Algorithm.

Boruvka's Algorithm.

Comparisons and Improvements.

Euclidean MST.

21. Shortest Paths.

Underlying Principles.

Dijkstra's Algorithm.

All-Pairs Shortest Paths.

Shortest Paths in Acyclic Networks.

Euclidean Networks.

Reduction.

Negative Weights.

Perspective.

22. Network Flow.

Flow Networks.

Augmenting-Path Maxflow Algorithms.

Preflow-Push Maxflow Algorithms.

Maxflow Reductions.

Mincost Flows.

Network Simplex Algorithm.

Mincost-Flow Reductions.

Perspective.

References for Part Five.

Index.

Begagnad bok

419 kr

Fri frakt & skickas inom 1-3 vardagar

Köpskydd med Studentapan

Varje köp täcks av Studentapans köpskydd som säkerställer att boken kommer fram, att du får rätt bok och att skicket stämmer överens med beskrivning.

Läs mer här

Om Algorithms in Java, Part 5 (2003)

I juli 2003 släpptes boken Algorithms in Java, Part 5 skriven av Robert Sedgewick. Det är den 3e upplagan av kursboken. Den är skriven på engelska och består av 528 sidor djupgående information om övrigt. Förlaget bakom boken är Pearson Education.

Köp boken Algorithms in Java, Part 5 direkt från en annan student på Studentapan och spara pengar.

Kurslitteratur Övrigt ÖvrigtAlgorithms in Java, Part 5

Böcker som säljs på Studentapan är begagnade. Därför kan vi inte garantera att eventuella digitala produkter eller inloggningar fortfarande är aktiva.

Bokens omdömen

Ingen har recenserat den här boken ännu.

Sälj vidare boken när du är klar

När du är klar med boken säljer du enkelt vidare och tjänar pengar på nolltid med Studentapan. Vi tar hand om allt det krångliga så att du får mer tid över till annat. På det sättet kan du tjäna tillbaka det mesta av kostnaden för boken.

Värdera & sälj böcker

Klimatsmart kurslitteratur

Bli en miljöhjälte under din studietid och ge dina gamla kursböcker ett nytt liv. Genom att återanvända dina kursböcker minskar du utsläppen av koldioxid (CO2) med hela 59%. För en psykologstudent skulle det innebära minskade CO2-utsläpp med cirka 240 kg under studietiden. En stor vinst för din plånbok och miljön. Det kallar vi klimatsmart kurslitteratur.