ConceptTheory & Algos
Single-source shortest paths
The problem of finding the shortest path weights from a single source vertex to all other vertices in a directed graph with 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
1Connections
4The lectures that define it or assume it, and the concepts next to it.