๐Ÿ“šย Reference


๐Ÿ“œย Chapter


Dijkstra algorithm

Floyd Warshall

โ€ฃ

Bellman-Ford


Bellman-Ford, Dijkstra algorithm - ๋น„๊ต


๋‹ค์ต์ŠคํŠธ๋ผ(Dijkstra) ๋ฒจ๋งŒ-ํฌ๋“œ(Bellman-Ford)
๊ฐ€์ค‘์น˜ ์Œ์ˆ˜ ๊ฐ€์ค‘์น˜ ๋ถˆ๊ฐ€๋Šฅ ์Œ์ˆ˜ ๊ฐ€์ค‘์น˜ ๊ฐ€๋Šฅ
์‹œ๊ฐ„ ๋ณต์žก๋„ O((V + E) log V) (Heap ์‚ฌ์šฉ) O(VE)
์•Œ๊ณ ๋ฆฌ์ฆ˜ ์œ ํ˜• Greedy Dynamic Programming
์‚ฌ์šฉ ์˜ˆ์‹œ ๋„ค๋น„๊ฒŒ์ด์…˜, ๋„คํŠธ์›Œํฌ ๋ผ์šฐํŒ… ์Œ์ˆ˜ ๊ฐ€์ค‘์น˜๊ฐ€ ์žˆ๋Š” ๊ฒฝ์šฐ (์˜ˆ: ๊ธˆ์œต)