Lesson 2 of 4Module 1 · 0% of course
‹ PrevNext ›
Explore › Math › Adjacent: Math for Thinking › Adjacent
Adjacent: Math for Thinking · Adjacent

Discrete Math & Graphs

Graphs as vertices and edges: Euler and the Königsberg bridges, degrees and the handshake lemma, paths, trees, coloring, shortest paths (Dijkstra) and why graphs model networks from maps to the web.

30 min · 5 steps · videoJump to quiz ↓
Intro to Graph Theory | Definitions & Ex: 7 Bridges of Konigsberg Dr. Trefor Bazett · 6 min
Open in YouTube
Step 1 of 5 · Overview30 min read ·
Key idea
Prereqs: Logic & proofs. Next: Algorithms (BFS/DFS); information theory. Sources: Lehman, Leighton & Meyer, *Mathematics for Computer Science* ch. 11–13; Trefor Bazett; MIT OCW.
Next: 1. Basics

Watch next

The Great Courses · 31 min · works as audio
Ben Syversen · 29 min · works as audio
Oxford Mathematics · 52 min · works as audio
Ben Syversen · 41 min · works as audio
Harvard University · 50 min · works as audio
Harvard University · 46 min · works as audio
Harvard University · 46 min · works as audio
MIT OpenCourseWare · 30 min · works as audio
MIT OpenCourseWare · 37 min · works as audio
Harvard University · 50 min · works as audio
Adams State University · 43 min · works as audio
‹ PrevNext ›