homeworks by Krivoruchko Dmitry

.devcontainer/devcontainer.json

@@ -1,48 +1,48 @@
 // For format details, see https://aka.ms/vscode-remote/devcontainer.json or this file's README at:
 // https://github.com/microsoft/vscode-dev-containers/tree/v0.195.0/containers/cpp
 {
-	"name": "C++",
-	"build": {
-		"dockerfile": "Dockerfile",
-		// Update 'VARIANT' to pick an Debian / Ubuntu OS version: debian-11, debian-10, debian-9, ubuntu-21.04, ubuntu-20.04, ubuntu-18.04
-		// Use Debian 11, Debian 9, Ubuntu 18.04 or Ubuntu 21.04 on local arm64/Apple Silicon
-		"args": {
-			"VARIANT": "ubuntu-24.04"
-		}
-	},
-	"runArgs": [
-		"--cap-add=SYS_PTRACE",
-		"--security-opt",
-		"seccomp=unconfined"
-	],
-	// Configure tool-specific properties.
-	"customizations": {
-		// Configure properties specific to VS Code.
-		"vscode": {
-			// Set *default* container specific settings.json values on container create.
-			"settings": {
-				"C_Cpp.clang_format_fallbackStyle": "Google",
-				"C_Cpp.clang_format_path": "clang-format",
-				"C_Cpp.clang_format_style": "file",
-				"C_Cpp.formatting": "clangFormat",
-				"clang-format.executable": "clang-format",
-				"clang-format.fallbackStyle": "Google",
-				"clang-format.language.cpp.enable": true,
-				"clang.executable": "clang",
-				"editor.formatOnSave": true
-			},
-			// Add the IDs of extensions you want installed when the container is created.
-			"extensions": [
-				"llvm-vs-code-extensions.vscode-clangd",
-				"ms-vscode.cpptools",
-				"xaver.clang-format"
-			]
-		}
-	},
-	// Use 'forwardPorts' to make a list of ports inside the container available locally.
-	// "forwardPorts": [],
-	// Use 'postCreateCommand' to run commands after the container is created.
-	// "postCreateCommand": "gcc -v",
-	// Comment out this line to run as root instead.
-	"remoteUser": "vscode"
+  "name": "C++",
+  "build": {
+    "dockerfile": "Dockerfile",
+    // Update 'VARIANT' to pick an Debian / Ubuntu OS version: debian-11, debian-10, debian-9, ubuntu-21.04, ubuntu-20.04, ubuntu-18.04
+    // Use Debian 11, Debian 9, Ubuntu 18.04 or Ubuntu 21.04 on local arm64/Apple Silicon
+    "args": {
+      "VARIANT": "ubuntu-24.04"
+    }
+  },
+  "runArgs": [
+    "--cap-add=SYS_PTRACE",
+    "--security-opt",
+    "seccomp=unconfined"
+  ],
+  // Configure tool-specific properties.
+  "customizations": {
+    // Configure properties specific to VS Code.
+    "vscode": {
+      // Set *default* container specific settings.json values on container create.
+      "settings": {
+        "C_Cpp.clang_format_fallbackStyle": "Google",
+        "C_Cpp.clang_format_path": "clang-format",
+        "C_Cpp.clang_format_style": "file",
+        "C_Cpp.formatting": "clangFormat",
+        "clang-format.executable": "clang-format",
+        "clang-format.fallbackStyle": "Google",
+        "clang-format.language.cpp.enable": true,
+        "clang.executable": "clang",
+        "editor.formatOnSave": true
+      },
+      // Add the IDs of extensions you want installed when the container is created.
+      "extensions": [
+        "llvm-vs-code-extensions.vscode-clangd",
+        "ms-vscode.cpptools",
+        "xaver.clang-format"
+      ]
+    }
+  },
+  // Use 'forwardPorts' to make a list of ports inside the container available locally.
+  // "forwardPorts": [],
+  // Use 'postCreateCommand' to run commands after the container is created.
+  // "postCreateCommand": "gcc -v",
+  // Comment out this line to run as root instead.
+  "remoteUser": "vscode"
 }

CMakeLists.txt

@@ -1,21 +1,23 @@
-cmake_minimum_required(VERSION 3.10)
+cmake_minimum_required(VERSION 3.20)
 
-project(homeworks)
+project(homeworks LANGUAGES CXX)
 
-add_subdirectory(${CMAKE_CURRENT_SOURCE_DIR}/lib)
+set(CMAKE_CXX_STANDARD 20)
+set(CMAKE_CXX_STANDARD_REQUIRED ON)
+set(CMAKE_CXX_FLAGS "-Wall -Wextra -pedantic -std=c++20 -O2")
 
+add_subdirectory(${CMAKE_CURRENT_SOURCE_DIR}/lib)
 add_subdirectory(${CMAKE_CURRENT_SOURCE_DIR}/sandbox)
-
 add_subdirectory(${CMAKE_CURRENT_SOURCE_DIR}/additional_tasks)
 
 file(GLOB_RECURSE tasks_dirs LIST_DIRECTORIES true ".")
 
 foreach(dir ${tasks_dirs})
-    IF(IS_DIRECTORY ${dir})
-        IF(${dir} MATCHES "task_0[0-9]$" AND NOT ${dir} MATCHES "build")
-            add_subdirectory(${dir})
-        ENDIF()
-    ELSE()
-        CONTINUE()
+  IF(IS_DIRECTORY ${dir})
+    IF(${dir} MATCHES "task_0[0-9]$" AND NOT ${dir} MATCHES "build")
+      add_subdirectory(${dir})
     ENDIF()
+  ELSE()
+    CONTINUE()
+  ENDIF()
 endforeach()

README.md

@@ -1,9 +1,10 @@
 # Домашнее задание для 2 семестра алгоритмов и структур данных
+## (Homework for second semester algorithms and data structures on MIPT DAFE/RSE)
 
 ### Для удобства можно пользоваться папкой lib, все файлы из этой папки будут подключаться к любой задаче
 
-### Можно получить дополнительные баллы, если добавить интересные текстовые задачи. Необходимы текст задачи, решение и тесты. Каждая задача отдельный ПР, полчуть дополнительные баллы можно только если пулл реквест замержен в основную ветку.
+Можно получить дополнительные баллы, если добавить интересные текстовые задачи. Необходимы текст задачи, решение и тесты. Каждая задача отдельный - Pull Request, получить дополнительные баллы можно только если PR замерджен в основную ветку.
 
-### Можно получить дополнительные баллы, если добавить теорию в папку doc. Делается в отдельном ПР, полчуть дополнительные баллы можно только если пулл реквест замержен в основную ветку.
+Можно получить дополнительные баллы, если добавить теорию в папку doc. Делается в отдельном PR, только если PR замерджен в основную ветку.
 
-### Код должен быть отформатирован clang-format'ом со стилем Google
+Код должен быть отформатирован clang-format'ом со стилем Google.

additional_tasks/CMakeLists.txt

@@ -5,11 +5,11 @@ project(additional_tasks)
 file(GLOB_RECURSE tasks_dirs LIST_DIRECTORIES true ".")
 
 foreach(dir ${tasks_dirs})
-    IF(IS_DIRECTORY ${dir})
-        IF(NOT ${dir} MATCHES ".*src.*")
-            add_subdirectory(${dir})
-        ENDIF()
-    ELSE()
-        CONTINUE()
+  IF(IS_DIRECTORY ${dir})
+    IF(NOT ${dir} MATCHES ".*src.*")
+      add_subdirectory(${dir})
     ENDIF()
+  ELSE()
+    CONTINUE()
+  ENDIF()
 endforeach()

lib/CMakeLists.txt

@@ -7,4 +7,5 @@ file(GLOB_RECURSE lib_source_list "src/*.cpp" "src/*.hpp")
 
 add_library(${PROJECT_NAME} ${lib_source_list})
 
+set_target_properties(${PROJECT_NAME} PROPERTIES LINKER_LANGUAGE CXX)
 target_include_directories(${PROJECT_NAME} PUBLIC ${CMAKE_CURRENT_SOURCE_DIR}/src)

lib/src/graph/for_integral/edge.cpp

@@ -0,0 +1,19 @@
+#include "../graph.hpp"
+
+GRAPH_TEMPLATE_CONSTRUCT_FOR_INTEGRAL;
+
+template <AllowedVertType vert_t, AllowedWeightType weight_t>
+const std::string& Graph<vert_t, weight_t>::Edge::Name() const {
+  static std::string name;
+
+  if (IsWeighted())
+    name = "[" + std::to_string(StartVert()) + "->" +
+           std::to_string(EndVert()) + ", w: " + std::to_string(Weight()) + "]";
+  else
+    name = "[" + std::to_string(StartVert()) + "->" +
+           std::to_string(EndVert()) + "]";
+
+  // example: "[4->5]"
+
+  return name;
+}

lib/src/graph/for_integral/graph_construct.cpp

@@ -0,0 +1,67 @@
+#include "../graph.hpp"
+
+GRAPH_TEMPLATE_CONSTRUCT_FOR_INTEGRAL;
+
+template <AllowedVertType vert_t, AllowedWeightType weight_t>
+Graph<vert_t, weight_t> Graph<vert_t, weight_t>::GraphFromAdjMatrix(
+    const std::vector<std::vector<weight_t>>& adj_matrix, bool is_weighted) {
+  if (adj_matrix.empty()) return Graph();
+
+  std::vector<Edge> edges{};
+
+  if (adj_matrix.size() != adj_matrix[0].size())
+    throw std::invalid_argument(
+        "GraphFromAdjMatrix: AdjacencyMatrix is not squared.");
+
+  for (size_t row = 0; row < adj_matrix.size(); row++) {
+    if (row != 0)
+      if (adj_matrix[row].size() != adj_matrix[row - 1].size())
+        throw std::invalid_argument(
+            "GraphFromAdjMatrix: AdjacencyMatrix is not squared [row "
+            "problem].");
+
+    for (size_t col = 0; col < adj_matrix[row].size(); col++) {
+      if (adj_matrix[row][col] == 0) continue;
+
+      if (is_weighted)
+        edges.push_back(Edge(col, row, adj_matrix[col][row]));
+      else
+        edges.push_back(Edge(col, row));
+    }
+  }
+
+  return Graph(edges);
+}
+
+template <AllowedVertType vert_t, AllowedWeightType weight_t>
+Graph<vert_t, weight_t> Graph<vert_t, weight_t>::GraphFromAdjList(
+    const std::vector<std::vector<vert_t>>& adj_list) {
+  if (adj_list.empty()) return Graph();
+
+  std::vector<Edge> edges{};
+
+  for (size_t row = 0; row < adj_list.size(); row++)
+    for (size_t col = 0; col < adj_list[row].size(); col++)
+      edges.push_back(Edge(row, adj_list[row][col]));
+
+  return Graph(edges);
+}
+
+template <AllowedVertType vert_t, AllowedWeightType weight_t>
+Graph<vert_t, weight_t>::Graph(const std::vector<Edge>& edges)
+    : edges_{edges}, verts_() {
+  if (edges.empty()) return;
+
+  // кол-во вершин = максимальная вершина среди ребер, т.е. в случае size_t
+  // происходит заполнение вершин до наибольшей из них в списке ребер
+  vert_t max_vert = 0;
+  for (const auto& edge : edges_) {
+    max_vert = std::max(max_vert, edge.StartVert());
+    max_vert = std::max(max_vert, edge.EndVert());
+  }
+
+  verts_.resize(max_vert + 1);
+  std::iota(verts_.begin(), verts_.end(), 0);
+
+  if (!IsDirected()) MakeUndirected();
+}

lib/src/graph/for_integral/graph_methods.cpp

@@ -0,0 +1,76 @@
+#include "../graph.hpp"
+
+GRAPH_TEMPLATE_CONSTRUCT_FOR_INTEGRAL;
+
+template <AllowedVertType vert_t, AllowedWeightType weight_t>
+std::vector<std::vector<vert_t>>
+Graph<vert_t, weight_t>::GetAdjListWithoutKeys() const {
+  std::vector<std::vector<vert_t>> adj_list(
+      *std::max_element(Verts().begin(), Verts().end()) + 1);
+
+  for (const auto& edge : edges_) {
+    adj_list[edge.StartVert()].push_back(edge.EndVert());
+    if (!IsDirected()) adj_list[edge.EndVert()].push_back(edge.StartVert());
+  }
+
+  return adj_list;
+}
+
+template <AllowedVertType vert_t, AllowedWeightType weight_t>
+std::vector<std::vector<weight_t>> Graph<vert_t, weight_t>::GetAdjMatrix()
+    const {
+  std::vector<std::vector<weight_t>> adj_matrix(
+      VertsAmount(), std::vector<weight_t>(VertsAmount(), 0));
+
+  for (const auto& edge : edges_)
+    if (edge.IsWeighted()) {
+      adj_matrix[edge.StartVert()][edge.EndVert()] = edge.Weight();
+      if (!IsDirected())
+        adj_matrix[edge.EndVert()][edge.StartVert()] = edge.Weight();
+    } else {
+      adj_matrix[edge.StartVert()][edge.EndVert()] = 1;
+      if (!IsDirected()) adj_matrix[edge.EndVert()][edge.StartVert()] = 1;
+    }
+
+  return adj_matrix;
+}
+
+template <AllowedVertType vert_t, AllowedWeightType weight_t>
+std::pair<vert_t, vert_t> Graph<vert_t, weight_t>::ParseEdgeString(
+    const std::string& edge_str) {
+  const vert_t pos = edge_str.find("->");
+
+  if (size_t(pos) == std::string::npos)
+    throw std::invalid_argument("EdgeString: invalid edge string format: " +
+                                edge_str);
+
+  try {
+    vert_t start_vert = std::stoul(edge_str.substr(0, pos));
+    vert_t end_vert = std::stoul(edge_str.substr(pos + 2));
+
+    return {start_vert, end_vert};
+  }
+
+  catch (...) {
+    throw std::invalid_argument(
+        "EdgeString: invalid edge string format "
+        "(vertices should be numbers): " +
+        edge_str);
+  }
+}
+
+template <AllowedVertType vert_t, AllowedWeightType weight_t>
+void Graph<vert_t, weight_t>::RemoveVert(vert_t vert) {
+  if (!Contains(Verts(), vert))
+    throw std::invalid_argument("RemoveVert: there is no such vert in graph: " +
+                                std::to_string(vert));
+
+  verts_.erase(std::remove(verts_.begin(), verts_.end(), vert), verts_.end());
+
+  edges_.erase(std::remove_if(edges_.begin(), edges_.end(),
+                              [vert](const Edge& edge) {
+                                return edge.StartVert() == vert ||
+                                       edge.EndVert() == vert;
+                              }),
+               edges_.end());
+}

lib/src/graph/for_string/edge.cpp

@@ -0,0 +1,18 @@
+#include "../graph.hpp"
+
+GRAPH_TEMPLATE_CONSTRUCT_FOR_STRING;
+
+template <AllowedVertType vert_t, AllowedWeightType weight_t>
+const std::string& Graph<vert_t, weight_t>::Edge::Name() const {
+  static std::string name;
+
+  if (IsWeighted())
+    name = "['" + StartVert() + "'->'" + EndVert() +
+           "', w: " + std::to_string(Weight()) + "]";
+  else
+    name = "['" + StartVert() + "'->'" + EndVert() + "']";
+
+  // example: "["Paris"->"Berlin"]"
+
+  return name;
+}

lib/src/graph/for_string/graph_construct.cpp

@@ -0,0 +1,37 @@
+#include "../graph.hpp"
+
+GRAPH_TEMPLATE_CONSTRUCT_FOR_STRING;
+
+template <AllowedVertType vert_t, AllowedWeightType weight_t>
+Graph<vert_t, weight_t>::Graph(const std::vector<Edge>& edges)
+    : edges_{edges}, verts_() {
+  if (edges.empty()) return;
+
+  for (const auto& edge : edges_) {
+    if (!Contains(Verts(), edge.StartVert()))
+      verts_.push_back(edge.StartVert());
+
+    if (!Contains(Verts(), edge.EndVert())) verts_.push_back(edge.EndVert());
+  }
+
+  if (!IsDirected()) MakeUndirected();
+}
+
+// DELETED methods
+
+template <AllowedVertType vert_t, AllowedWeightType weight_t>
+Graph<vert_t, weight_t> Graph<vert_t, weight_t>::GraphFromAdjMatrix(
+    [[maybe_unused]] const std::vector<std::vector<weight_t>>& adj_matrix,
+    [[maybe_unused]] bool is_weighted) {
+  throw std::logic_error(
+      "GraphFromAdjMatrix: this method (constructor) "
+      "is deleted for std::string.");
+}
+
+template <AllowedVertType vert_t, AllowedWeightType weight_t>
+Graph<vert_t, weight_t> Graph<vert_t, weight_t>::GraphFromAdjList(
+    [[maybe_unused]] const std::vector<std::vector<vert_t>>& adj_list) {
+  throw std::logic_error(
+      "GraphFromAdjList: this method (constructor) "
+      "is deleted for std::string.");
+}