| 释义 |
minimum connector problem The problem in graph theory to find a minimum cost spanning tree of a connected weighted graph. In practical terms, this is the situation faced by service companies laying cables or pipes, which is essentially different from constructing any sort of transport links between the points. Kruskal's algorithm and Prim's algorithm are two standard approaches to solving this problem.
|