update

problems/dsas_aog_week3_paths_in_graphs1_2_bipartite/.gitignore

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

problems/dsas_aog_week3_paths_in_graphs1_2_bipartite/README.md

@@ -0,0 +1,19 @@
+# DSAS Problem 
+
+## Usage
+
+Run program with an example
+
+```
+bazel run src/main:bipartite < tests/data/1.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_week3_paths_in_graphs1_2_bipartite/src/main/BUILD

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

problems/dsas_aog_week3_paths_in_graphs1_2_bipartite/src/main/bipartite.cpp

@@ -0,0 +1,50 @@
+#include <iostream>
+#include <queue>
+#include <vector>
+
+using std::queue;
+using std::vector;
+
+using namespace std;
+int n, m;
+
+int bipartite(vector<vector<int>> &adj) {
+  vector<int> color(n, 0);
+  queue<int> q;
+
+  for (int i = 0; i < n; i++) {
+    if(color[i] != 0){
+      continue;
+    }
+    color[i] = 1;
+    q.push(i);
+    while (!q.empty()) {
+      int u = q.front();
+      q.pop();
+      for (int v : adj[u]) {
+        if (color[v] == 0) {
+          color[v] = -color[u];
+          q.push(v);
+        } else {
+          if (color[v] == color[u]) {
+            return 0;
+          }
+        }
+      }
+    }
+  }
+
+  return 1;
+}
+
+int main() {
+  std::cin >> n >> m;
+  vector<vector<int>> adj(n, vector<int>());
+  for (int i = 0; i < m; i++) {
+    int x, y;
+    std::cin >> x >> y;
+    adj[x - 1].push_back(y - 1);
+    adj[y - 1].push_back(x - 1);
+  }
+  std::cout << bipartite(adj);
+}

problems/dsas_aog_week3_paths_in_graphs1_2_bipartite/src/main/bipartite_1.cpp

@@ -0,0 +1,59 @@
+#include <iostream>
+#include <queue>
+#include <vector>
+
+using std::queue;
+using std::vector;
+
+int n, m;
+
+int bipartite(vector<vector<int> > &adj) {
+  // Set up a color array to store the colors of the vertices
+  // Initially, all vertices are unmarked (color = -1)
+  vector<int> colors(n, -1);
+
+  // Set up a queue for the BFS
+  queue<int> q;
+
+  // Start at vertex 0 and mark it with color 0 (red)
+  colors[0] = 0;
+  q.push(0);
+
+  // While the queue is not empty
+  while (!q.empty()) {
+    // Get the next vertex from the queue
+    int v = q.front();
+    q.pop();
+
+    // Visit all neighbors of v
+    for (int u : adj[v]) {
+      // If the neighbor has not been visited yet
+      if (colors[u] == -1) {
+        // Mark the neighbor with the opposite color of v
+        colors[u] = 1 - colors[v];
+        // Add the neighbor to the queue
+        q.push(u);
+      }
+      // If the neighbor has already been visited and has the same color as v
+      else if (colors[u] == colors[v]) {
+        // The graph is not bipartite
+        return 0;
+      }
+    }
+  }
+
+  // If we reach this point, the graph is bipartite
+  return 1;
+}
+
+int main() {
+  std::cin >> n >> m;
+  vector<vector<int> > adj(n, vector<int>());
+  for (int i = 0; i < m; i++) {
+    int x, y;
+    std::cin >> x >> y;
+    adj[x - 1].push_back(y - 1);
+    adj[y - 1].push_back(x - 1);
+  }
+  std::cout << bipartite(adj);
+}

problems/dsas_aog_week3_paths_in_graphs1_2_bipartite/src/main/bipartite_starter.cpp

@@ -0,0 +1,24 @@
+#include <iostream>
+#include <vector>
+#include <queue>
+
+using std::vector;
+using std::queue;
+
+int bipartite(vector<vector<int> > &adj) {
+  //write your code here
+  return -1;
+}
+
+int main() {
+  int n, m;
+  std::cin >> n >> m;
+  vector<vector<int> > adj(n, vector<int>());
+  for (int i = 0; i < m; i++) {
+    int x, y;
+    std::cin >> x >> y;
+    adj[x - 1].push_back(y - 1);
+    adj[y - 1].push_back(x - 1);
+  }
+  std::cout << bipartite(adj);
+}

problems/dsas_aog_week3_paths_in_graphs1_2_bipartite/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_week3_paths_in_graphs1_2_bipartite/tests/data/1.in

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

problems/dsas_aog_week3_paths_in_graphs1_2_bipartite/tests/data/1.out

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

problems/dsas_aog_week3_paths_in_graphs1_2_bipartite/tests/data/2.in

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

problems/dsas_aog_week3_paths_in_graphs1_2_bipartite/tests/data/2.out

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

problems/dsas_aog_week3_paths_in_graphs1_2_bipartite/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();
+}