ConceptTheory & Algos
Shortest path problem
Finding the shortest path between a pair of vertices in a graph with non-negative edge weights.
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
5Connections
13The lectures that define it or assume it, and the concepts next to it.
Concepts7
- Edge weight
- Graph
- Bellman-Ford algorithm
- Bidirectional Dijkstra search
- Bidirectional search
- DAG shortest path