Cognitive Scaffold

Preparing your thinking workspace

arrow_back_ios_new
MENTAL MODEL · M12448

Dijkstra's Algorithm

Dijkstra's Algorithm
TechnicalHigh supportAlgorithms
Included
account_tree

Version 1.0.0 · Updated 2026-07-30

CORE DEFINITION

A classic algorithm for computing the shortest paths from a starting node to all other nodes in a graph. It uses a greedy strategy, each time selecting the unvisited node with the current shortest distance.

SCAFFOLDING EFFECT

psychology

Reduce cognitive load

The power of optimal substructure. Subpaths of shortest paths are also shortest paths—this property allows the problem to be decomposed.

anchor

Anchor fast decisions

In a non-negative weighted graph, use a greedy approach with a priority queue to find the single-source shortest path, progressively locking in the shortest distances.

MINIMUM ACTION

In progress 0/1

Practice this model in one real situation:

Check to track your progress (stored locally)
Learning progress0%
account_treeGenealogyexpand_more
menu_bookReferencesexpand_more

Source support: Explicit

  • link
    en.wikipedia.orghttps://en.wikipedia.org/wiki/Dijkstra%27s_algorithmZH · Explicit
    verified

RELATED MODELS

Related model

Classical Formulas

Specifically refers to the formulas in Zhang Zhongjing's 'Treatise on Cold Damage and Miscellaneous Diseases' from the Han Dynasty.

arrow_forwardRelated model

Superforecasting

The Good Judgment Project (GJP) is an organization dedicated to "harnessing the wisdom of the crowd to forecast world events". It was co-created by Philip E. Tetlock (author of Superforecasting: The Art and Science of Prediction and Expert Political Judgment), decision scientist Barbara Mellers, and…

arrow_forwardRelated model

Print Capitalism

Capitalism, in order to expand the book/newspaper market, standardized dialects into a standard print language, enabling people who had never met to imagine themselves as part of the same 'community' (nation) by reading the same language.

arrow_forward