「圖(graph)」由「邊(edge /arc)」連接「節點/頂點(node / vertex)」形成,而「樹(tree)」是圖的子集合,代表不成環、且無節點落單的無向圖。「最小生成樹(minimum spanning tree, MST)」探討的是如何透過移除最少權重(weight)的邊,使一原非屬「樹」的無向圖變成「樹」。 普林演算法(Prim’s algorithm)...
一個啟發式演算法在選擇內部節點最小生成樹問題上 A heuristic algorithm for the selected-internal minimum spanning tree problem Chan-Shuo Liu1, Yu Ting Kuo2, Chung Wen Ma3 Department of Computer Science, Taipei Municipal University of Education, Taiwan g982109@go.tmue.edu.tw1, kuo5400@hotmail....