Prim ián-sǹg-hoat

Wikipedia (chū-iû ê pek-kho-choân-su) beh kā lí kóng...
跳至導覽 跳至搜尋
Ké-soeh tōng-ōe.

Prim ián-sǹg-hoat (eng. Prim's algorithm) sī chi̍t khoán tham-sim ián-sǹg-hoat (greedy algorithm), thang tī chi̍t-ê thiam-tāng (weighted) bû-hong-hiòng tô͘-sek (undirected graph) chhōe chhut chòe-sió lia̍h-tn̂g chhiū (minimum spanning tree). Che piáu-sī i thang chhōe chi̍t cho͘ piⁿ (edge) khan-liân só͘-ū ê tiám (vertex), jî-chhiá hia-ê piⁿ sio-ha̍p ū chòe-sió ê lúi-tāng.

Pún ián-sǹg-hoat ūn-choán ê hong-sek sī chi̍t kái chhù-lí chi̍t tiám, tùi sui-chāi ê tiám khai-sí, pí chi̍t pō͘ tùi chhiū-á ka-thiam siāng khin-khó ê liân-kiat kòe kî-tha ê bó͘ chi̍t tiám.