spanning-tree problem

  1. 生成树问题

网络词典

spanning-tree problem

英 ˈsæpənɪt ˈtrɪːp 美 ˈsæpənɪt ˈtrɪːp
名词中文翻译1 中文翻译:Unknown
同义词: ['crossing tree problem', 'spanning tree problem']

例句:

  1. 1. The spanning tree algorithm is used to solve the spanning-tree problem in graph theory.
    图论中,使用跨越树算法来解决跨度树问题。
  2. 2. The spanning tree problem is a classic example of a combinatorial optimization problem.
    跨度树问题是组合优化问题的经典例子。
  3. 3. In the spanning tree problem, we need to find a spanning tree that connects all the vertices of a graph.
    在跨度树问题中,我们需要找到一棵连接图中所有顶点的连通树。