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.
0 次浏览 数据来源: Wiktionary