ConceptSystems & CS
Directed graph
A graph where edges can be directed so that the relationship can go one way or both ways.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Opens up
Concepts that name this one as a prerequisite.
Lecturers
2Each in their own terms, from the easiest level.
Marten van Dijk
A graph where edges have a specific direction so you can walk from one vertex to another.
Lectures that assume it
26The first 12 are shown.
- Course Overview, Interval Scheduling
- Harvard CS50’s Artificial Intelligence with Python – Full University Course
- Games, Generalized Geography
- Dijkstra's Shortest Path Algorithm: Graph Theory and Optimization
- Depth-First Search (DFS), Topological Sort
- Max-st-Flow is a Linear Program
- Convex Optimization with Abstract Linear Operators
- Incremental Improvement: Matching
- Space Complexity
- Permanent is #P-complete
- Dynamic Programming: All-Pairs Shortest Paths
- Incremental Improvement: Max Flow, Min Cut
Connections
36The lectures that define it or assume it, and the concepts next to it.
Concepts8
Show 2 moreShow fewer
Lectures28
- Graph Optimization
- Graph Theory III
- Course Overview, Interval Scheduling
- Harvard CS50’s Artificial Intelligence with Python – Full University Course
- Games, Generalized Geography
- Dijkstra's Shortest Path Algorithm: Graph Theory and Optimization
Show 22 moreShow fewer
- Depth-First Search (DFS), Topological Sort
- Max-st-Flow is a Linear Program
- Convex Optimization with Abstract Linear Operators
- Incremental Improvement: Matching
- Space Complexity
- Permanent is #P-complete
- Dynamic Programming: All-Pairs Shortest Paths
- Incremental Improvement: Max Flow, Min Cut
- Dynamic Graphs II
- Bayes' Nets: Inference (Variable Elimination)
- NP-Completeness
- Boolean Satisfiability (SAT)
- Savitch's Theorem and NL
- NL-Completeness and Logspace Reductions
- Convex Optimization II: Decomposition Applications
- Single-Source Shortest Paths Problem
- Relations, Partial Orders, and Scheduling
- L and NL, NL = coNL
- Time Complexity
- Approximately Packing Dijoins Via Nowhere-Zero Flows
- Depth-First Search (DFS) (MIT 6.006, Recitation 14)
- Dynamic Programming: Crazy Eights and Shortest Path (MIT 6.006, Recitation 19)