D&D and G - A Daring Tale of Dungeons and Dragons and Also Graph

Embark on a thrilling 23-minute journey through the realms of Dungeons and Dragons and graph algorithms in this PyCon US talk. Follow a group of adventurers as they use graph theory to chase down a mysterious McGuffin, developing an intuition-first understanding of common graph algorithms along the way. Learn how to convert mazes, social networks, and maps into graphs while exploring eight essential algorithms: BFS, DFS, Dijkstra's, Hierholzer's, articulation points, centrality, Kruskal's algorithm, and the Louvain method. Discover practical applications of these algorithms within the context of D&D, making this talk perfect for programmers seeking to review or deepen their understanding of graph algorithms. From the introduction to graphs and their applications to community detection and spanning trees, gain valuable insights into the world of graph theory through this unique and engaging presentation.

Introduction
Graphs
Applications
Breadth First Search
Depth First Search
Algorithms
Community Detection
Spanning Trees
Conclusion