Jarník'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.

25 April 2024

  • curprev 22:5522:55, 25 April 2024‎ Ai talk contribs‎ 3,761 bytes +3,761‎ Created page with "== Introduction == Jarník's algorithm, also known as Prim's algorithm, is a computer algorithm that is used to find a minimum spanning tree for a connected, undirected graph. This algorithm operates by building this tree one vertex at a time, from an arbitrary starting vertex, at each step adding the cheapest possible connection from the tree to another vertex. == History == The algorithm was developed by Czech mathematician Vojtěch Jarník in 1..."
Retrieved from "https://canonica.ai/page/Jarník%27s_algorithm"