๋ณธ๋ฌธ ๋ฐ”๋กœ๊ฐ€๊ธฐ
Problem Solving/Algorithm, Tips

Kruskal / Prim Algorithm (ํฌ๋ฃจ์Šค์นผ / ํ”„๋ฆผ ์•Œ๊ณ ๋ฆฌ์ฆ˜)

by ํ–‰๋ฑ 2020. 6. 2.

https://www.youtube.com/watch?v=LQ3JHknGy8c : MST ๊ฐœ๋…๊ณผ ํฌ๋ฃจ์Šค์นผ ์•Œ๊ณ ๋ฆฌ์ฆ˜ ์„ค๋ช… (์œ ํˆฌ๋ฒ„ ๋™๋นˆ๋‚˜)

https://www.youtube.com/watch?v=AMByrd53PHM : ํฌ๋ฃจ์Šค์นผ์— ์‚ฌ์šฉ๋˜๋Š” union-find ์•Œ๊ณ ๋ฆฌ์ฆ˜ ์„ค๋ช… (์œ ํˆฌ๋ฒ„ ๋™๋นˆ๋‚˜)

 

https://www.youtube.com/watch?v=71UQH7Pr9kU : ํฌ๋ฃจ์Šค์นผ 2๋ถ„์งœ๋ฆฌ ์˜์ƒ

https://www.youtube.com/watch?v=cplfcGZmX7I : ํ”„๋ฆผ 2๋ถ„์งœ๋ฆฌ ์˜์ƒ

 

https://stackoverflow.com/questions/1195872/when-should-i-use-kruskal-as-opposed-to-prim-and-vice-versa

 

When should I use Kruskal as opposed to Prim (and vice versa)?

I was wondering when one should use Prim's algorithm and when Kruskal's to find the minimum spanning tree? They both have easy logics, same worst cases, and only difference is implementation which ...

stackoverflow.com

: ํฌ๋ฃจ์Šค์นผ๊ณผ ํ”„๋ฆผ์€ ๊ฐ๊ฐ ์–ธ์ œ ์‚ฌ์šฉํ•ด์•ผ ํ•˜๋Š”๊ฐ€?

์š”์•ฝ: ํฌ๋ฃจ์Šค์นผ์€ ์—์ง€ ์ค‘์‹ฌ, ํ”„๋ฆผ์€ ๋…ธ๋“œ ์ค‘์‹ฌ์œผ๋กœ ์—์ง€๊ฐ€ ๋งŽ์€ dense ๊ทธ๋ž˜ํ”„์˜ ๊ฒฝ์šฐ ํ”„๋ฆผ์„ ์‚ฌ์šฉํ•˜๊ณ  ์ผ๋ฐ˜์ ์ธ sparse ๊ทธ๋ž˜ํ”„์˜ ๊ฒฝ์šฐ ํฌ๋ฃจ์Šค์นผ์„ ์‚ฌ์šฉํ•ด๋ผ.

 

๋Œ“๊ธ€