kruskal's algorithm

Fetched 2026-10-26 (cache).

Synonyms: kruskals algorithm

Antonyms: kruskals algorithm

Related words from Datamuse; suggestions, not definitions.

Proper noun

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.

Source: Wiktionary · CC BY-SA 4.0 (Wiktionary dump) · cached copy, not a rewrite.