GH-111: Solve problem dsas_aog_week2_graph_decomposition2_1_cs_curriculum

README.md

@@ -176,7 +176,7 @@ A data structure is a data organization, management, and storage format that is
 
 **Courses & Specialization**
 
-* [🍨 Data Structures and Algorithms Specialization](collections/datastructures-and-algorithms-specialization/)
+* [🍨 Data Structures and Algorithms Specialization](collections/datastructures-and-algorithms-specialization/), University of California San Diego
 
 
 ## Contributors

collections/datastructures-and-algorithms-specialization/README.md

@@ -19,7 +19,7 @@
 </thead>
 <tbody>
 <tr>
-<td colspan="3" align="left"><b>Week 1: Graph Decomposition</b></td>
+<td colspan="3" align="left"><b>Week 1: Decomposition of Graph 1</b></td>
 </tr>
 <tr>
 <td>1. Finding Exit From Maze</td>
@@ -35,6 +35,16 @@
 <a href="../../problems/dsas_aog_week1_graph_decomposition1_2_adding_exits_to_maze/src/main/connected_components.cpp"><code>cpp🐀</code></a>
 </td>
 </tr>
+<tr>
+<td colspan="3" align="left"><b>Week 2: Decomposition of Graph 2</b></td>
+</tr>
+<tr>
+<td>1. Checking Consistency of CS Curriculum</td>
+<td><a href="../../problems/dsas_aog_week2_graph_decomposition2_1_cs_curriculum/doc/week2_graph_decomposition2.pdf">Link</a></td>
+<td>
+<a href="../../problems/dsas_aog_week2_graph_decomposition2_1_cs_curriculum/src/main/acyclicity.cpp"><code>cpp🐀</code></a>
+</td>
+</tr>
 </tbody>
 </table>
 

problems/dsas_aog_week2_graph_decomposition2_1_cs_curriculum/.gitignore

@@ -0,0 +1 @@
+solution

problems/dsas_aog_week2_graph_decomposition2_1_cs_curriculum/README.md

@@ -0,0 +1,20 @@
+# DSAS Problem 
+
+## Usage
+
+Run program with an example
+
+```
+bazel run src/main:acyclicity < tests/data/1.in
+bazel run src/main:acyclicity < tests/data/2.in
+```
+
+Test program
+
+```
+# Run all tests
+bazel test --test_output=all tests:solution_test
+bazel test --test_output=all --cache_test_results=no tests:solution_test
+# Run test with pecific test id
+bazel test --test_output=all tests:solution_test --test_arg=1
+```

problems/dsas_aog_week2_graph_decomposition2_1_cs_curriculum/src/main/BUILD

@@ -0,0 +1,7 @@
+load("@rules_cc//cc:defs.bzl", "cc_binary")
+
+cc_binary(
+    name = "acyclicity",
+    srcs = ["acyclicity.cpp"],
+    visibility = ["//visibility:public"],
+)

problems/dsas_aog_week2_graph_decomposition2_1_cs_curriculum/src/main/acyclicity.cpp

@@ -0,0 +1,53 @@
+#include <iostream>
+#include <vector>
+
+using std::pair;
+using std::vector;
+
+#define N 1000
+bool visited[N];
+bool recursion_stack[N];
+
+bool dfs(vector<vector<int>> adj, int i){
+  visited[i] = true;
+  recursion_stack[i] = true;
+  for(auto j: adj[i]){
+    if(!visited[j]){
+      bool output = dfs(adj, j);
+      if(output){
+        return true;
+      }
+    } else {
+      if(recursion_stack[j]){
+        return true;
+      }
+    }
+  }
+  recursion_stack[i] = false;
+  return false;
+};
+
+// return true if the give graph has cycle.
+int acyclic(vector<vector<int>> &adj, int n) {
+  for(int i=0; i<n; i++){
+    if(!visited[i]){
+      bool output = dfs(adj, i);
+      if(output){
+        return 1;
+      }
+    }
+  }
+  return 0;
+}
+
+int main() {
+  size_t n, m;
+  std::cin >> n >> m;
+  vector<vector<int>> adj(n, vector<int>());
+  for (size_t i = 0; i < m; i++) {
+    int x, y;
+    std::cin >> x >> y;
+    adj[x - 1].push_back(y - 1);
+  }
+  std::cout << acyclic(adj, n);
+}

problems/dsas_aog_week2_graph_decomposition2_1_cs_curriculum/src/main/solution.cpp

@@ -0,0 +1,19 @@
+#include <cmath>
+#include <vector>
+#include <map>
+#include <algorithm>
+#include <string>
+#include <iostream>
+
+using namespace std;
+
+int main(){
+  ios::sync_with_stdio(false);
+  cin.tie(0);
+  int tt;
+  cin >> tt;
+  while(tt--){
+    cout << tt << '\n';
+  }
+  return 0;
+}

problems/dsas_aog_week2_graph_decomposition2_1_cs_curriculum/tests/BUILD

@@ -0,0 +1,11 @@
+load("@rules_cc//cc:defs.bzl", "cc_binary", "cc_test")
+
+cc_test(
+    name = "solution_test",
+    srcs = ["solution_test.cpp"],
+    deps = [
+      "//problems/codeforcesAA/src/main:solution",
+      "@com_google_googletest//:gtest_main",
+    ],
+    data = ["data"]
+)

problems/dsas_aog_week2_graph_decomposition2_1_cs_curriculum/tests/data/1.in

@@ -0,0 +1,5 @@
+4 4
+1 2
+4 1
+2 3
+3 1

problems/dsas_aog_week2_graph_decomposition2_1_cs_curriculum/tests/data/1.out

@@ -0,0 +1,5 @@
+4
+3
+2
+1
+0

problems/dsas_aog_week2_graph_decomposition2_1_cs_curriculum/tests/data/2.in

@@ -0,0 +1,7 @@
+5 7
+1 2
+2 3
+1 3
+3 4
+1 4
+2 5

problems/dsas_aog_week2_graph_decomposition2_1_cs_curriculum/tests/data/2.out

@@ -0,0 +1,10 @@
+9
+8
+7
+6
+5
+4
+3
+2
+1
+0

problems/dsas_aog_week2_graph_decomposition2_1_cs_curriculum/tests/solution_test.cpp

@@ -0,0 +1,97 @@
+#include <cstdlib>
+#include <filesystem>
+#include <fstream>
+#include <iostream>
+#include <string>
+#include <string_view>
+#include <vector>
+
+#include "gtest/gtest.h"
+
+namespace fs = std::filesystem;
+
+using namespace std;
+
+std::string TEST_ID = "";
+
+vector<string> split(string s, string delimiter) {
+  size_t pos_start = 0, pos_end, delim_len = delimiter.length();
+  string token;
+  vector<string> res;
+
+  while ((pos_end = s.find(delimiter, pos_start)) != string::npos) {
+    token = s.substr(pos_start, pos_end - pos_start);
+    pos_start = pos_end + delim_len;
+    res.push_back(token);
+  }
+
+  res.push_back(s.substr(pos_start));
+  return res;
+}
+
+std::string GetHello(std::string_view in) {
+  if (in.size() == 0) {
+    return std::string("hello, word");
+  } else {
+    return std::string("Hello, ") + in.data();
+  }
+}
+
+string ReadFile(const std::string &filename) {
+  std::ifstream f(filename);
+  string s((std::istreambuf_iterator<char>(f)),
+           std::istreambuf_iterator<char>());
+  return s;
+}
+
+vector<string> RunProgram(string fileid) {
+  vector<string> v;
+  string program = "problems/codeforcesAA/src/main/solution";
+  string test_folder = "problems/codeforcesAA/tests/data/";
+  string command = program + " < " + test_folder + fileid + ".in > output.txt";
+  std::system(command.c_str());
+  string actual = ReadFile("output.txt");
+  string expectedOutputFile = test_folder + fileid + ".out";
+  string expected = ReadFile(expectedOutputFile);
+  v.push_back(actual);
+  v.push_back(expected);
+  return v;
+}
+
+TEST(RunTest, AllTestCases) {
+  if (TEST_ID != "") {
+    std::cout << "TEST_ID = " << TEST_ID << std::endl;
+  } else {
+    std::cout << "RUN ALL TESTS" << std::endl;
+  }
+
+  std::string test_data_folder = "problems/codeforcesAA/tests/data";
+  for (const auto &entry : fs::directory_iterator(test_data_folder)) {
+    string filename = split(entry.path(), "/").back();
+    vector<string> v = split(filename, ".");
+    string fileid = v[0];
+    string extension = v[1];
+    if (extension != "in"){
+      continue;
+    }
+    if (TEST_ID != ""){
+      if (fileid != TEST_ID){
+        continue;
+      }
+    }
+    // Run Test Case
+    vector<string> output = RunProgram(fileid);
+    string actual = output[0];
+    string expected = output[1];
+    string message = "❌ FAIL CASE: " + fileid;
+    ASSERT_EQ(actual, expected) << message;
+  }
+}
+
+int main(int argc, char **argv) {
+  ::testing::InitGoogleTest(&argc, argv);
+  if (argc == 2) {
+    TEST_ID = argv[1];
+  }
+  return RUN_ALL_TESTS();
+}