Graph Algorithms the Fun Way

Part 1: Graph Basics
Chapter 1: Representing Graphs
Chapter 2: Neighbors and Neighborhoods
Chapter 3: Paths Through Graphs

Part 2: 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 Searches

Part 3: 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: Markov Systems

Part 4: Max-Flow and Bipartite Matching
Chapter 14: Max-Flow Algorithms
Chapter 15: Bipartite Graphs and Bipartite Matching

Part 5: 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 Data Structures

Este título pertence ao(s) assunto(s) indicados(s). Para ver outros títulos clique no assunto desejado.

• Algoritmos e estruturas de dados
• Programação e linguagens de script: geral
• As redes neurais e sistemas nebulosos

connectivity;python;graph algorithms;data structures;coding;computers;computer;technology;code;coding for kids;algorithm;computer programming;python programming;clean code;algorithms;tech;python for data analysis;python machine learning;learning python;python for beginners;coding for beginners;python data science;computer books;python 3;programmer gifts;computer programmer gifts;math;programming;mathematics;statistics;computer science;numbers;math books;data;logic;physics;algebra;geometry