Kruskal's algorithm

English

Proper noun

Kruskal's algorithm

  1. An algorithm in discrete mathematics/graph theory that is used to generate the minumum spanning tree in a given direction of two paths. It translates a forest from the nodes in the graph, considering each node as its own tree.
This article is issued from Wiktionary. The text is available under Creative Commons Attribution-Share Alike 4.0 unless otherwise noted. Additional terms may apply for the media files.