[Algorithm] 그래프 알고리즘 비교(MST, kruskal, prim, dijkstra, floyd-warshall, bellman-ford)

.compare Graph Algorithms .MST(Minimum Spanning Tree), 최소신장트리 정점 -1개의 간선으로 이루어진 신장트리 중에서 가중치의 합이 가장 작은 것고르는 간선은 사이클을 만들지 않아야 하고, 가중치가 작은 것들부터 골라져야 함 * 절대적이진 않지만, 간선이 적으면 KRUSKAL, 간선이 많으면 PRIM 알고리즘이 유리 .KRUSKAL (간선을 고르는 간선 중심)MST 의 목적을 이루기 위해 간선들을 가중치 오름차순으로 정렬해두고,사이클을 만들지 않는 간선이라면 골라나가서 N-1 개를 고르면 완료참고 ㅇ Use edgeList12345678910111213141516171819202122232425262728293031323334353637383940414243444..
PS/Algorithm 2020. 10. 13. 10:46
[BOJ] 15684. 사다리 조작(백트래킹)

#. Problemhttps://www.acmicpc.net/problem/15684* The copyright in this matter is in BOJ #. 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 improve it #. Solve 실수해서 시간을 엄청 날린 문제다..
PS/Problem_Solving 2020. 10. 12. 23:38
[BOJ] 2636.치즈(BFS, DFS).java

#. Problemhttps://www.acmicpc.net/problem/2636* The copyright in this matter is in BOJ #. 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 improve it #. Solve 완전 탐색이 적용된 시뮬레이션 문제..
PS/Problem_Solving 2020. 10. 7. 21:57
[BOJ] 17144.미세먼지 안녕!(시뮬레이션).java

#. Problemhttps://www.acmicpc.net/problem/17144* The copyright in this matter is in BOJ #. 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 improve it #. Solve 시뮬레이션은 하라는대로 구현을 잘..
PS/Problem_Solving 2020. 10. 6. 23:53
[BOJ] 소가 길을 건너간 이유 Series.java

소가 길을 건너간 이유 6 을 풀고,문제가 너무 재미있어서나도 소가 길을 건너간 이유를 연구해보려고 한다. 일명.. Cow R&D..... #. Series 1https://www.acmicpc.net/problem/14467* The copyright in this matter is in BOJ #. Solve Cow R&D 에 온 걸 환영하는 문제다. 먼저 소가 길을 건너는 것을 관찰하면서처음 확인하는 소라면 위치를 체크해두고이미 확인했던 소라면 길을 건넜는지 확인해주자. #. Code 1234567891011121314151617181920212223242526272829303132333435363738394041import java.io.BufferedReader;import java.io.IOE..
PS/Problem_Solving 2020. 10. 3. 20:52
[BOJ] 14466.소가 길을 건너간 이유 6(DFS, BFS).java

#. Problemhttps://www.acmicpc.net/problem/14466* The copyright in this matter is in BOJ #. 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 improve it #. Solve 처음에 문제를 잘못 이해하고 이상..
PS/Problem_Solving 2020. 10. 3. 18:45
[BOJ] 19952.인성 문제 있어??(BFS).java

#. Problemhttps://www.acmicpc.net/problem/19952* The copyright in this matter is in BOJ #. 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 improve it #. Solve 범위는 2 ≤ H, W ≤ 100..
PS/Problem_Solving 2020. 10. 2. 19:12
[BOJ] 2147.로봇 시뮬레이션(시뮬레이션).java

#. Problemhttps://www.acmicpc.net/problem/2174* The copyright in this matter is in BOJ #. 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 improve it #. Solve 이 문제는 좌표가 우리가 흔히 사용..
PS/Problem_Solving 2020. 10. 1. 21:13
1 ··· 5 6 7 8 9 10 11 ··· 23
최근에 올라온 글
최근에 달린 댓글
링크
Total
Today
Yesterday
TAG more