update

Author: yester31

lecture1/lecture1/ex036.cpp

@@ -10,19 +10,21 @@ using namespace chrono;
 
 void ex036() {
     vector<int> a{ 7, 11, 5, 6, 10, 9 };
-    int j;
+    
     for (int i = 1; i < a.size(); i++) {
         int tmp = a[i];
-        for (j = i - 1; j >= 0; j--) {
+        int j;
+        for (j = i - 1; j >= 0; j--) { // 역순회
             if (a[j] > tmp) {
                 a[j + 1] = a[j]; // 뒤로 이동
             }
             else {
                 break;
             }
         }
-        a[j + 1] = tmp; // 현재까지 정렬된 숫자들 바로 뒤에 삽입
+        a[j + 1] = tmp; // 현재까지 정렬된 숫자들 앞에 삽입
     }
+    // 결과 출력
     for (int i = 0; i < a.size(); i++) {
         cout << a[i] << ' ';
     }

lecture1/lecture1/ex042.cpp

@@ -23,6 +23,7 @@ void sort_insert2(vector<int> & vec) {
 void ex042() {
     int M = 32;
     vector<int> a{ 23, 87, 65, 12, 57, 32, 99, 81 };
+
     sort_insert2(a); // ¿À¸¥Â÷¼ø Á¤·Ä
     int lt = 0;
     int rt = a.size() - 1;

lecture1/lecture1/ex058.cpp

@@ -43,7 +43,6 @@ void ex058() {
     dfs_mid(1);
     cout << endl;
     dfs_post(1);
-
 }
 
 //int main() {

lecture1/lecture1/ex066.cpp

@@ -5,13 +5,45 @@
 using namespace std;
 
 // 경로 탐색(DFS : 인접리스트 방법)
+static int cnt = 0;
+static const int n = 5;
+static vector<int> ch(n + 1);
+static vector<vector<int>> map(n + 1);
+
+void dfs(int v) {
+    if (v == n) {
+        cnt++;
+    }
+    else {
+        for (int i = 0; i < map[v].size(); i++) {
+            if (ch[map[v][i]] == 0) {
+                ch[map[v][i]] = 1;
+                dfs(map[v][i]);
+                ch[map[v][i]] = 0;
+            }
+        }
+    }
+}
 
 void ex066() {
+    int v = 9;
+    vector<vector<int>> inputs{ {1, 2}, {1, 3}, {1, 4}, {2, 1}, {2, 3}, {2, 5}, {3, 4}, {4, 2}, {4, 5} };
+    for (auto itr = inputs.begin(); itr != inputs.end(); ++itr) {
+        map[((*itr)[0])].push_back((*itr)[1]);
+    }
+    for (int i = 0; i < map.size(); i++) {
+        for (int j = 0; j < map[i].size(); j++) {
+            cout << map[i][j] << " ";
+        }cout << endl;
+    }
+    ch[1] = 1;
+    dfs(1);
+    cout << cnt << endl;
 
 }
 
-int main() {
-    ex066();
-    cout << endl << "done!" << endl;
-}
-// 8
+//int main() {
+//    ex066();
+//    cout << endl << "done!" << endl;
+//}
+// 6

lecture1/lecture1/ex067.cpp

@@ -0,0 +1,43 @@
+#include <iostream>
+#include <vector>
+#include <string>
+#include <stack>
+using namespace std;
+
+// 경로 탐색(DFS : 인접리스트 방법)
+static int cost = 2147000000;
+static const int n = 5;
+static vector<int> ch(n+1);
+static vector<vector<int>> map(n+1 , vector<int>(n+1, 0));
+
+static void dfs(int v, int sum) {
+    if (v == 5) {
+        if (cost > sum)
+            cost = sum;
+    }
+    else {
+        for (int i = 1; i < map[v].size(); i++) {
+            if (ch[i] == 0 && map[v][i] != 0) {
+                ch[i] = 1;
+                dfs(i, sum + map[v][i]);
+                ch[i] = 0;
+            }
+        }
+    }
+}
+
+void ex067() {
+    vector<vector<int>> inputs{ {1, 2, 12}, {1, 3, 6}, {1, 4, 10}, {2, 3, 2}, {2, 5, 2}, {3, 4, 3}, {4, 2, 2}, {4, 5, 5} };
+    for (int i = 0; i < inputs.size(); i++) {
+        map[inputs[i][0]][inputs[i][1]] = inputs[i][2];
+    }
+    ch[1] = 1;
+    dfs(1, 0);
+    cout << cost << endl;
+}
+
+//int main() {
+//    ex067();
+//    cout << endl << "done!" << endl;
+//}
+// 13

lecture1/lecture1/lecture1.vcxproj

@@ -189,6 +189,7 @@
     <ClCompile Include="ex064.cpp" />
     <ClCompile Include="ex065.cpp" />
     <ClCompile Include="ex066.cpp" />
+    <ClCompile Include="ex067.cpp" />
   </ItemGroup>
   <Import Project="$(VCTargetsPath)\Microsoft.Cpp.targets" />
   <ImportGroup Label="ExtensionTargets">

lecture1/lecture1/lecture1.vcxproj.filters

@@ -213,5 +213,8 @@
     <ClCompile Include="ex066.cpp">
       <Filter>소스 파일</Filter>
     </ClCompile>
+    <ClCompile Include="ex067.cpp">
+      <Filter>소스 파일</Filter>
+    </ClCompile>
   </ItemGroup>
 </Project>