Borůvka's algorithm

短语

释义与例句

name
  1. 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.

    数学