Dekorationsartikel gehören nicht zum Leistungsumfang.
Sprache:
Englisch
42,25 €*
Versandkostenfrei per Post / DHL
auf Lager, Lieferzeit 1-2 Werktage
Kategorien:
Beschreibung
"This book provides a fun and accessible introduction to graph algorithms, a type of data structure used to solve a wide range of problems in mathematics and computer science. The book uses diagrams and real-world examples in the Python programming language to teach readers about the structure of graphs and how they can represent connections using different graphing algorithms. Readers will apply this knowledge to problems such as finding the shortest paths through a graph; estimating costs of paths through a graph; randomizing graphs; prioritizing nodes; determining which components in a graph are essential to maintaining its integrity; and calculating how much data can flow from one point in a graph to the next"-- Provided by publisher.
"This book provides a fun and accessible introduction to graph algorithms, a type of data structure used to solve a wide range of problems in mathematics and computer science. The book uses diagrams and real-world examples in the Python programming language to teach readers about the structure of graphs and how they can represent connections using different graphing algorithms. Readers will apply this knowledge to problems such as finding the shortest paths through a graph; estimating costs of paths through a graph; randomizing graphs; prioritizing nodes; determining which components in a graph are essential to maintaining its integrity; and calculating how much data can flow from one point in a graph to the next"-- Provided by publisher.
Über den Autor
Jeremy Kubica
Inhaltsverzeichnis
Introduction
Part I: Graph Basics
Chapter 1: Representing Graphs
Chapter 2: Neighbors and Neighborhoods
Chapter 3: Paths Through Graphs
Part II: Search and Shortest Paths
Chapter 4: Depth-First Search
Chapter 5: Breadth-First Search
Chapter 6: Solving Puzzles
Chapter 7: Shortest Paths
Chapter 8: Heuristic Guided Searches
Part III: Connectivity and Ordering
Chapter 9: Topological Sort
Chapter 10: Minimum Spanning Tree
Chapter 11: Bridges and Articulation Points
Chapter 12: Strongly Connected Components
Chapter 13: Random Walks
Part IV: Max-Flow and Bipartite Matching
Chapter 14: Max-Flow Algorithms
Chapter 15: Bipartite Graphs and Bipartite Matching
Part V: Hard Graph Problems
Chapter 16: Graph Coloring
Chapter 17: Independent Sets and Cliques
Chapter 18: Tours Through Graphs
Appendix A: Constructing Graphs
Appendix B: Priority Queue
Appendix C: Union-Find
Conclusion
Part I: Graph Basics
Chapter 1: Representing Graphs
Chapter 2: Neighbors and Neighborhoods
Chapter 3: Paths Through Graphs
Part II: Search and Shortest Paths
Chapter 4: Depth-First Search
Chapter 5: Breadth-First Search
Chapter 6: Solving Puzzles
Chapter 7: Shortest Paths
Chapter 8: Heuristic Guided Searches
Part III: Connectivity and Ordering
Chapter 9: Topological Sort
Chapter 10: Minimum Spanning Tree
Chapter 11: Bridges and Articulation Points
Chapter 12: Strongly Connected Components
Chapter 13: Random Walks
Part IV: Max-Flow and Bipartite Matching
Chapter 14: Max-Flow Algorithms
Chapter 15: Bipartite Graphs and Bipartite Matching
Part V: Hard Graph Problems
Chapter 16: Graph Coloring
Chapter 17: Independent Sets and Cliques
Chapter 18: Tours Through Graphs
Appendix A: Constructing Graphs
Appendix B: Priority Queue
Appendix C: Union-Find
Conclusion
Details
Erscheinungsjahr: | 2024 |
---|---|
Fachbereich: | Programmiersprachen |
Genre: | Importe, Informatik |
Rubrik: | Naturwissenschaften & Technik |
Medium: | Taschenbuch |
Inhalt: | Einband - flex.(Paperback) |
ISBN-13: | 9781718503861 |
ISBN-10: | 1718503865 |
Sprache: | Englisch |
Einband: | Kartoniert / Broschiert |
Autor: | Kubica, Jeremy |
Hersteller: |
Random House LLC US
No Starch Press |
Verantwortliche Person für die EU: | Petersen Buchimport GmbH, Vertrieb, Weidestr. 122a, D-22083 Hamburg, gpsr@petersen-buchimport.com |
Maße: | 236 x 182 x 30 mm |
Von/Mit: | Jeremy Kubica |
Erscheinungsdatum: | 19.11.2024 |
Gewicht: | 0,78 kg |
Über den Autor
Jeremy Kubica
Inhaltsverzeichnis
Introduction
Part I: Graph Basics
Chapter 1: Representing Graphs
Chapter 2: Neighbors and Neighborhoods
Chapter 3: Paths Through Graphs
Part II: Search and Shortest Paths
Chapter 4: Depth-First Search
Chapter 5: Breadth-First Search
Chapter 6: Solving Puzzles
Chapter 7: Shortest Paths
Chapter 8: Heuristic Guided Searches
Part III: Connectivity and Ordering
Chapter 9: Topological Sort
Chapter 10: Minimum Spanning Tree
Chapter 11: Bridges and Articulation Points
Chapter 12: Strongly Connected Components
Chapter 13: Random Walks
Part IV: Max-Flow and Bipartite Matching
Chapter 14: Max-Flow Algorithms
Chapter 15: Bipartite Graphs and Bipartite Matching
Part V: Hard Graph Problems
Chapter 16: Graph Coloring
Chapter 17: Independent Sets and Cliques
Chapter 18: Tours Through Graphs
Appendix A: Constructing Graphs
Appendix B: Priority Queue
Appendix C: Union-Find
Conclusion
Part I: Graph Basics
Chapter 1: Representing Graphs
Chapter 2: Neighbors and Neighborhoods
Chapter 3: Paths Through Graphs
Part II: Search and Shortest Paths
Chapter 4: Depth-First Search
Chapter 5: Breadth-First Search
Chapter 6: Solving Puzzles
Chapter 7: Shortest Paths
Chapter 8: Heuristic Guided Searches
Part III: Connectivity and Ordering
Chapter 9: Topological Sort
Chapter 10: Minimum Spanning Tree
Chapter 11: Bridges and Articulation Points
Chapter 12: Strongly Connected Components
Chapter 13: Random Walks
Part IV: Max-Flow and Bipartite Matching
Chapter 14: Max-Flow Algorithms
Chapter 15: Bipartite Graphs and Bipartite Matching
Part V: Hard Graph Problems
Chapter 16: Graph Coloring
Chapter 17: Independent Sets and Cliques
Chapter 18: Tours Through Graphs
Appendix A: Constructing Graphs
Appendix B: Priority Queue
Appendix C: Union-Find
Conclusion
Details
Erscheinungsjahr: | 2024 |
---|---|
Fachbereich: | Programmiersprachen |
Genre: | Importe, Informatik |
Rubrik: | Naturwissenschaften & Technik |
Medium: | Taschenbuch |
Inhalt: | Einband - flex.(Paperback) |
ISBN-13: | 9781718503861 |
ISBN-10: | 1718503865 |
Sprache: | Englisch |
Einband: | Kartoniert / Broschiert |
Autor: | Kubica, Jeremy |
Hersteller: |
Random House LLC US
No Starch Press |
Verantwortliche Person für die EU: | Petersen Buchimport GmbH, Vertrieb, Weidestr. 122a, D-22083 Hamburg, gpsr@petersen-buchimport.com |
Maße: | 236 x 182 x 30 mm |
Von/Mit: | Jeremy Kubica |
Erscheinungsdatum: | 19.11.2024 |
Gewicht: | 0,78 kg |
Sicherheitshinweis