Jeremy Kubica is an engineering director working at the intersection of computer science and astrophysics. He holds a PhD in robotics from Carnegie Mellon University and a BS in computer science from Cornell University. He is the author of The CS Detective, Data Structures the Fun Way (both from No Starch Press), and Computational Fairy Tales.

"Graphs may be the most natural data structure in the world. This comprehensive book unpacks the magic and mystery of many fascinating graph algorithms that enable powerful applications and insights from graphs."—Kirk Borne, PhD, Chief Science Officer at DataPrime

• IntroductionPart I: Graph BasicsChapter 1: Representing GraphsChapter 2: Neighbors and NeighborhoodsChapter 3: Paths Through GraphsPart II: Search and Shortest PathsChapter 4: Depth-First SearchChapter 5: Breadth-First SearchChapter 6: Solving PuzzlesChapter 7: Shortest PathsChapter 8: Heuristic Guided SearchesPart III: Connectivity and OrderingChapter 9: Topological SortChapter 10: Minimum Spanning TreeChapter 11: Bridges and Articulation PointsChapter 12: Strongly Connected ComponentsChapter 13: Random WalksPart IV: Max-Flow and Bipartite MatchingChapter 14: Max-Flow AlgorithmsChapter 15: Bipartite Graphs and Bipartite MatchingPart V: Hard Graph ProblemsChapter 16: Graph ColoringChapter 17: Independent Sets and CliquesChapter 18: Tours Through GraphsAppendix A: Constructing GraphsAppendix B: Priority QueueAppendix C: Union-FindConclusion

Jeremy Kubica is an engineering director working at the intersection of computer science and astrophysics. He holds a PhD in robotics from Carnegie Mellon University and a BS in computer science from Cornell University. He is the author of The CS Detective, Data Structures the Fun Way (both from No Starch Press), and Computational Fairy Tales.

"Graphs may be the most natural data structure in the world. This comprehensive book unpacks the magic and mystery of many fascinating graph algorithms that enable powerful applications and insights from graphs."—Kirk Borne, PhD, Chief Science Officer at DataPrime

• IntroductionPart I: Graph BasicsChapter 1: Representing GraphsChapter 2: Neighbors and NeighborhoodsChapter 3: Paths Through GraphsPart II: Search and Shortest PathsChapter 4: Depth-First SearchChapter 5: Breadth-First SearchChapter 6: Solving PuzzlesChapter 7: Shortest PathsChapter 8: Heuristic Guided SearchesPart III: Connectivity and OrderingChapter 9: Topological SortChapter 10: Minimum Spanning TreeChapter 11: Bridges and Articulation PointsChapter 12: Strongly Connected ComponentsChapter 13: Random WalksPart IV: Max-Flow and Bipartite MatchingChapter 14: Max-Flow AlgorithmsChapter 15: Bipartite Graphs and Bipartite MatchingPart V: Hard Graph ProblemsChapter 16: Graph ColoringChapter 17: Independent Sets and CliquesChapter 18: Tours Through GraphsAppendix A: Constructing GraphsAppendix B: Priority QueueAppendix C: Union-FindConclusion

Jeremy Kubica is an engineering director working at the intersection of computer science and astrophysics. He holds a PhD in robotics from Carnegie Mellon University and a BS in computer science from Cornell University. He is the author of The CS Detective, Data Structures the Fun Way (both from No Starch Press), and Computational Fairy Tales.

"Graphs may be the most natural data structure in the world. This comprehensive book unpacks the magic and mystery of many fascinating graph algorithms that enable powerful applications and insights from graphs."—Kirk Borne, PhD, Chief Science Officer at DataPrime

• IntroductionPart I: Graph BasicsChapter 1: Representing GraphsChapter 2: Neighbors and NeighborhoodsChapter 3: Paths Through GraphsPart II: Search and Shortest PathsChapter 4: Depth-First SearchChapter 5: Breadth-First SearchChapter 6: Solving PuzzlesChapter 7: Shortest PathsChapter 8: Heuristic Guided SearchesPart III: Connectivity and OrderingChapter 9: Topological SortChapter 10: Minimum Spanning TreeChapter 11: Bridges and Articulation PointsChapter 12: Strongly Connected ComponentsChapter 13: Random WalksPart IV: Max-Flow and Bipartite MatchingChapter 14: Max-Flow AlgorithmsChapter 15: Bipartite Graphs and Bipartite MatchingPart V: Hard Graph ProblemsChapter 16: Graph ColoringChapter 17: Independent Sets and CliquesChapter 18: Tours Through GraphsAppendix A: Constructing GraphsAppendix B: Priority QueueAppendix C: Union-FindConclusion