Dijkstra ián-sǹg-hoat

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

Dijkstra ián-sǹg-hoat (eng. Dijkstra's algorithm) sī chi̍t khoán beh tī tô͘-sek (graph) lāi-bīn ê chat (node) tang-tiong chhōe siāng-té lō͘-sòaⁿ ê ián-sǹg-hoat. Pún hoat tāi-seng sī 1956 nî ha̍k-chiá Edsger W. Dijkstra hoat-bêng--ê.

Chit-ê ián-sǹg-hoat í-keng ū chē khoán piàn-hêng, nā Dijkstra tong-chho͘ ê siat-sióng, sī beh chōe nn̄g-ê chat chi kan siāng-té ê lō͘-sòaⁿ, chóng-sī khah phó͘-thong ê chi̍t chióng piàn-khoán, sī kā bó͘ chi̍t chat siat chò "hoat-goân", tùi hit tiám khai-sí chhōe chi̍t tiâu thang kiâⁿ kòe só͘-ū chat-tiám ê lō͘, sán-seng chi̍t-ê siāng-té lō͘-sòaⁿ chhiū (shortest-path tree).