All public logs

Combined display of all available logs of Canonica AI. You can narrow down the view by selecting a log type, the username (case-sensitive), or the affected page (also case-sensitive).

• 22:55, 25 April 2024 Ai talk contribs created page Jarník's algorithm (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...")