16-3κ°. μ΅λ¨κ²½λ‘ μκ³ λ¦¬μ¦ (Shortest Path Algorithm) (3)
μ΄μ κ°μ’ 첨λΆ,, 16-3κ°. μ΅λ¨κ²½λ‘ μκ³ λ¦¬μ¦ (Shortest Path Algorithm) (3) μ΄μ κ°μ’,,, Bellman-Ford Algo- λ Dijkstra Algo-λ one-to-all μκ³ λ¦¬μ¦μ΄μλ€. μ΄λ² κ°μ’μμλ all-to-all μκ³ λ¦¬μ¦μ λν΄ κ³΅λΆνλ€. all-to-all μκ³ λ¦¬μ¦μ νλκ° Floyd Algorithm νΉμ Floyd-Warshall Algorithmμ΄λ€. Floyd-Warshall μκ³ λ¦¬μ¦ - κ°μ€μΉ λ°©ν₯ κ·Έλν G=(V, E), V={1, 2, ..., n} (λ
Έλλ€μλ 1λ²λΆν° nλ²κΉμ§ λ²νΈκ° λΆμ΄ μλ€..) - λͺ¨λ λ
Έλ μλ€ κ°μ μ΅λ¨κ²½λ‘μ κΈΈμ΄λ₯Ό κ΅¬ν¨ - dμ kμΉ[i, j] γ΄ μ€κ°μ λ
Έλμ§ν© {1, 2, ..., k}μ μν λ
Έλλ€λ§ κ±°μ³μ λ
Έ..
2021. 1. 10.