Anonymous
Anonymous asked in 電腦與網際網路軟體 · 2 decades ago

以Kruskal方法求最小花費擴張樹

以Kruskal方法求最小花費擴張樹(minimum cost spanning tree),在演算法中被歸類為?

2 Answers

Rating
  • 光暄
    Lv 7
    2 decades ago
    Favorite Answer

    以Kruskal方法求最小花費擴張樹(minimum cost spanning tree),在演算法中被歸類為Greedy Algoritm(貪婪演算法)。

  • Anonymous
    6 years ago
Still have questions? Get your answers by asking now.