Kruskal's algorithm (English, name)
expansion: Kruskal's algorithm
Senses:
glosses: 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.
Forms: