[Inflearn] 최소비용(DFS : 가중치 방향그래프 인접리스트 사용)
#. 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] 최소비용(DFS : 인접행렬 사용)
#. 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] 경로 탐색(DFS : 인접리스트 사용)
#. 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..
1#include cs .빈 벡터 생성-- a 라는 이름을 가진 int 자료형의 빈 벡터1234vector a; a.push_back(3);printf("%d\n", a.size()); // 벡터 a 의 원소 개수 a.pop_back();cs-- .크기를 가진 벡터 생성-- b 라는 이름을 가진 int 자료형의 크기가 5인 벡터 - 소괄호123456vector b(5); // 초기 원소 값은 0으로 초기화b[1] = 3;printf("%d\n", b[1]); // 초기값을 다른 값으로 초기화 할 경우(12345)vector b(5, 12345); cs-- .벡터 배열-- c 라는 이름을 가진 배열 3개 생성 (벡터 배열) - 대괄호-- ex) 인접리스트1234vector c[3];c[0].push_bac..
[Inflearn] 미로탐색(DFS)
#. 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 - 7 * 7 격자판 미로 탈출 경로의 가지수 - 출발점은 (1,1), 도착점은 (7,7) - 격자판 1은 벽, 0 은 통로 - 상하좌우로만 이동 3. Create solution plan (select Algorithm, Data structure) - DFS 4. Prove the plan (check performance ti..
[Inflearn] 경로 탐색(DFS : 인접행렬 사용)
#. 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..
[Algorithm] 인접행렬(가중치 방향그래프)
#. 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..
[Algorithm] 병합정렬(분할정복)
#. 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..