Dijkstra ián-sǹg-hoat
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--ê.
![](http://upload.wikimedia.org/wikipedia/commons/thumb/5/57/Dijkstra_Animation.gif/220px-Dijkstra_Animation.gif)
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).
🔥 Top keywords: Thâu-ia̍hCarles PuigdemontTek-pia̍t:尋討Tē-jī-chhù Sè-kài Tāi-chiànWikipediaWikipedia:Chhiū-á-khaKho-kúPang-chān:Bo̍k-lio̍kSin-bûn sū-kiāⁿEdgeworth (Pennsylvania)eca6qWikipedia:Siā-lí mn̂g-chhùi-kháuWikipedia:Bián-chek seng-bêngJ.WilliamsWikipedia:Tāi-sài-koánTek-pia̍t:最近其改變Wikipedia:It-poaⁿ ê seng-bêngPortal:Sin-bûn sū-kiāⁿBân-lâm-gúWikipedia:Hoan-gêng sin iōng-chiá1 goe̍h 11 ji̍tSpiro (Oklahoma)Danny DeVitoTek-pia̍t:我其討論Chū-iû lōe-iôngItizyô Thian-hông1229 nîVeliky NovgorodCOVID-19AristotélēsMediaWikiPang-chān:新手入門99 nî800 nîWikipedia:Chhiū-á-kha/Chhng-khò͘ 6Khì-kongProvinsMacOSIōng-chiá thó-lūn:Ndgf741