Graphs Are Everywhere!
summary
Covers concrete graph techniques and results: implements Dijkstra shortest-path on a 17-city Lithuanian road graph (Vilnius→Majiki = 302 km) and confirms the route closely matches Google Maps; notes link‑state routing uses Dijkstra in IP networks; applies graph coloring for scheduling to update 75,000 instances in eight batches; measures coupling with cluster coefficient and finds community detection exposes distributed‑monolith risk; uses PageRank/hub‑authority to spot busy “gold” classes.
AI-written summary · about
chapters (23)
- 0:00Introduction
- 1:35What are graphs
- 3:50Leonardo Euler
- 8:18Graph Algorithms
- 15:01Legacy Link State Protocol
- 15:56Graph Coloring
- 16:31Graph Scheduling
- 18:21Applying a Graph Theory
- 18:41Microservice Architecture
- 19:48Cluster Coefficients
- 20:44Improving Resilience
- 21:24Community Protection
- 22:45ObjectOriented Code
- 23:19Web Page Ranking
- 23:58Legacy Systems
- 24:57Social Networks
- 25:24Six Degrees of Separation
- 25:46Six Degrees of Kevin Bacon
- 26:17The Diameter of a Graph
- 27:33Network Science
- 28:51Summary
- 29:54Conclusion
- 30:46Questions
related talks
43mGraphs are Everywhere
37mExploring Graphs with Ruby
41mLarge Road-Network analysis with GraphX
46mGraph Algorithms: Predict Real-World Behavior
31mGraph Analytics - From the Whiteboard to Your Toolbox
15mSee What the Graph Sees: Demystifying PageRank Through Visual Storytelling
13mManaging Connections with Graphs: Uses and Challenges
01h 41mGraph Intelligence: Enhance Reasoning and Retrieval Using Graph Analytics