ConceptTheory & Algos
Shortest path
A path between two nodes in a graph that uses the fewest number of edges.
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
1Lectures that assume it
17The first 12 are shown.
- Dijkstra's Shortest Path Algorithm: Graph Theory and Optimization
- Hardness within P
- Dynamic Programming I: Fibonacci, Shortest Paths
- The Dictionary City: Londoners and the Oxford English Dictionary
- Dijkstra's Algorithm: Greedy Single-Source Shortest Paths
- Linear Programming: LP, Reductions, Simplex
- Dynamic Programming: All-Pairs Shortest Paths
- Search: Optimal, Branch and Bound, A*
- Bellman-Ford
- Efficient Fine-Grained Algorithms
- Shortest Paths
- Single-Source Shortest Paths Problem
Connections
25The lectures that define it or assume it, and the concepts next to it.
Concepts7
Show 1 moreShow fewer
Lectures18
- Breadth-First Search (BFS)
- Dijkstra's Shortest Path Algorithm: Graph Theory and Optimization
- Hardness within P
- Dynamic Programming I: Fibonacci, Shortest Paths
- The Dictionary City: Londoners and the Oxford English Dictionary
- Dijkstra's Algorithm: Greedy Single-Source Shortest Paths
Show 12 moreShow fewer
- Linear Programming: LP, Reductions, Simplex
- Dynamic Programming: All-Pairs Shortest Paths
- Search: Optimal, Branch and Bound, A*
- Bellman-Ford
- Efficient Fine-Grained Algorithms
- Shortest Paths
- Single-Source Shortest Paths Problem
- Synchronous Distributed Algorithms: Symmetry-Breaking and Shortest-Paths Spanning Trees
- Speeding up Dijkstra
- Recovering Riemannian Metric Distance from Random Geometric Graphs
- Dynamic Programming: Crazy Eights and Shortest Path (MIT 6.006, Recitation 19)
- Topics in Algorithms Research