D&D and G a daring tale of Dungeons and Dragons and also Graph
summary
Story framing converts mazes, maps and social networks into explicit graphs and walks through eight named algorithms — BFS vs DFS, Dijkstra path lengths, Hierholzer, articulation points, degree centrality, Kruskal and the Louvain method — while showing Python representations (adjacency/edge lists, dictionaries, networkx and numpy). Small demos build a tavern/sewer maze and a messaging graph, compare hop-minimizing versus weight-minimizing routes, extract communities and critical nodes, and note practical limits like write-heavy workloads and when graphs misencode relationships.
AI-written summary · about
chapters (9)
- 0:00Introduction
- 2:12Graphs
- 6:56Applications
- 14:46Breadth First Search
- 15:41Depth First Search
- 17:09Algorithms
- 18:52Community Detection
- 20:10Spanning Trees
- 21:07Conclusion
related talks
01h 12mSocial Network Analysis in Python
37mGraphs, Networks and Python: The Power of Interconnection
28mGraphs and Vogue Dance: using data structures to create choreographies
01h 25mNetwork Science, Game of Thrones and US Airports
50mThe Shape of Data: Machine Learning and Topology
39mUsing Graph Neural Networks to Embrace the Dependency Within Your Data
26mGetting an Edge with Network Analysis with Python
26mPython & DAG architecture: Winning combination for dev of complex algo agile flows