Construct · 1 fields · 1 citations

Dijkstra's algorithm: a standalone construct

One name. One construct. A landmark on the map.

● anchor · a standalone construct Nearest construct by meaning·not indexed

A single standalone construct; nearby constructs are located against it in the Collider. Tap a field for its definition, unit, and measures.

Computer science

an algorithm that finds shortest paths from a source in a graph with nonnegative edge weights by growing a set of settled nodes.

In computer science, Dijkstra's algorithm refers to an algorithm that finds shortest paths from a source in a graph with nonnegative edge weights by growing a set of settled nodes. This meaning comes from Dijkstra (1959) in Numerische Mathematik.[1]

Unit
Recovery means
Measured by

Run it through the Collider, or take the citations with you.

See how Dijkstra's algorithm sits against neighbouring constructs in the Collider, or export every reference on this page in one click.

Open in Collider Export BibTeX Report this entry

Nearby constructs

edge5 fields · 5 citationsjingle · one word, five constructs source4 fields · 4 citationsjingle · one word, four constructs

References

Dijkstra, E. W. (1959). A note on two problems in connexion with graphs. Numerische Mathematik, 1(1), 269-271. https://doi.org/10.1007/bf01386390

Cited on this page?

Confirm your construct, or correct us.

If your work is cited behind one of these entries, you know better than we do whether we captured the meaning right. Confirm it, suggest an edit, or dispute it, and your name goes on the entry as an author who has checked it, linked to your ORCID.

Claim your construct