Graph Algorithms the Fun Way

CONTENTS IN DETAIL

1. TITLE PAGE
2. COPYRIGHT
3. DEDICATION
4. ABOUT THE AUTHOR AND TECHNICAL REVIEWER
5. ACKNOWLEDGMENTS
6. INTRODUCTION
7. Who Is This Book For?
8. Analogies and Examples
9. Language and Coding Conventions
10. Terminology and Definitions
11. How to Use This Book
12. PART I: GRAPH BASICS
13. 1REPRESENTING GRAPHS
14. Graph Structure
15. Weighted Edges
16. Directed Edges
17. Edges with Both Weight and Direction
18. The Adjacency List Representation
19. Edges
20. Nodes
21. The Graph Class
22. The Adjacency Matrix Representation
23. Why This Matters
24. 2NEIGHBORS AND NEIGHBORHOODS
25. Neighbors in Undirected Graphs
26. Neighbors in Directed Graphs
27. Self-Loops
28. Degree
29. Clustering Coefficient
30. Computing the Average Clustering Coefficient
31. Handling Limitations
32. Generating Neighborhood Subgraphs
33. The Code
34. An Example
35. Why This Matters ...