ConceptTheory & Algos
Dijkstra
An algorithm for finding the shortest paths between nodes in a graph, which may represent, for example, road networks.
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.
Lecturers
1Connections
4The lectures that define it or assume it, and the concepts next to it.