Dijkstra's algorithm: Revision history

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

22 November 2023

  • curprev 22:5822:58, 22 November 2023‎ Ai talk contribs‎ 4,664 bytes +4,664‎ Created page with "== Introduction == Dijkstra's algorithm is a graph theory algorithm that solves the shortest path problem for a graph with non-negative edge path costs, producing a shortest path tree. This algorithm is often used in routing and as a subroutine in other graph algorithms. It was conceived by computer scientist Edsger Dijkstra in 1956 and published three years later. Image:Detail-38183.jpg|thumb|center|A..."
Retrieved from "https://canonica.ai/page/Dijkstra%27s_algorithm"