YoVDO

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

Offered By: PyCon US via YouTube

Tags

PyCon US Courses Programming Courses Dijkstra's Algorithm Courses Kruskal's Algorithm Courses Social Networks Courses Graph Algorithms Courses Breadth-First Search Courses Depth-First Search Courses

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
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.

Syllabus

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


Taught by

PyCon US

Related Courses

Computer Vision: The Fundamentals
University of California, Berkeley via Coursera
Programming Languages
University of Virginia via Udacity
Learn to Program: Crafting Quality Code
University of Toronto via Coursera
Computational Photography
Georgia Institute of Technology via Coursera
Algorithms: Design and Analysis, Part 2
Stanford University via Coursera