HomeServicesBlogDictionariesContactSpanish Course
← Back to search

Meaning of Kruskal's algorithm | Babel Free

Noun CEFR B2

Definitions

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.

CEFR level

B2
Upper Intermediate
This word is part of the CEFR B2 vocabulary — upper intermediate level.
See all B2 English words →

See also

Learn this word in context

See Kruskal's algorithm used in real conversations inside our free language course.

Start Free Course

Know this word better than we do? Language is a living thing — help us keep it growing. Collaborate with Babel Free