ConceptMathematics
Edge weight
A non-negative number associated with an edge representing its relative likelihood.
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.
Graph theory1Markov chain1
Opens up
Concepts that name this one as a prerequisite.
Lecturers
1Lectures that assume it
11- Matching Problems
- Dijkstra's Shortest Path Algorithm: Graph Theory and Optimization
- Hardness within P
- Relaxing Integer Linear Programs to Linear Programs: Bipartite Maximum Perfect Matching
- Graph Theory II: Minimum Spanning Trees
- Dynamic Programming: All-Pairs Shortest Paths
- Search: Optimal, Branch and Bound, A*
- Bellman-Ford
- Single-Source Shortest Paths Problem
- Speeding up Dijkstra
- The Life and Times of Edsger Dijkstra
Connections
18The lectures that define it or assume it, and the concepts next to it.