Kruskal's algorithm
Meanings
name
- 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.
Word forms
Previous
This entry uses open data from Wiktionary (CC BY-SA/GFDL). Word forms are used for search and are not indexed as separate pages.