Borůvka's algorithm

专有名词

英文释义

专有名词
  1. A greedy algorithm for finding a minimum spanning tree in a graph, or a minimum spanning forest in the case of a graph that is not connected.
0 次浏览 数据来源: Wiktionary