[Inflearn] 원더랜드(Prim MST 알고리즘 : priority_queue 활용)(c/c++)
#. Problemhttps://www.inflearn.com/course/%EC%95%8C%EA%B3%A0%EB%A6%AC%EC%A6%98* The copyright in this matter is in Inflearn #. Resolution Process 1. Read and understand problem 2. Redefine the problem + abstract 3. Create solution plan (select Algorithm, Data structure) 4. Prove the plan (check performance time and usage memory) 5. Carry out the plan 6. Look back on the plan and find a way to im..
[Inflearn] 원더랜드(Kruskal MST 알고리즘 : Union&Find 활용)(c/c++)
#. Problemhttps://www.inflearn.com/course/%EC%95%8C%EA%B3%A0%EB%A6%AC%EC%A6%98* The copyright in this matter is in Inflearn #. Resolution Process 1. Read and understand problem 2. Redefine the problem + abstract - 모든 도시를 서로 연결하면서 최소의 유지비용이 들도록 도로를 선택하고, 나머지 도로는 폐쇄 - 재정에 도움이 되는 도로는 비용을 음수로 표현 - 모든 도시를 연결하면서 드는 최소비용을 출력 3. Create solution plan (select Algorithm, Data structure) 4. Prove the plan (..