changes after review 2

Author: mitya-y

README.md

@@ -6,6 +6,10 @@ cuBool based graph analysis algorithms
 regular_path_query - Single-Source Regular Path Query Algorithm in Terms of Linear Algebra
 
 # Run tests
+cuBoolGraph supports Linux-based OS (tested on Ubuntu 24.04 and Manjaro 6.19).
+For building project are required gcc version 14 and later, CMake with version 3.25 and later, CUDA developing toolkint version 12.0 and later. 
+
+For build and run tests execute commands
 ```
 git submodule update --init --recursive
 cmake -B build -DCUBOOL_GRAPH_ENABLE_TESTING=ON

include/regular_path_query.hpp

@@ -5,9 +5,9 @@
 cuBool_Matrix regular_path_query_with_transposed(
   // vector of sparse graph matrices for each label
   const std::vector<cuBool_Matrix> &graph, const std::vector<cuBool_Index> &source_vertices,
-  // vector of sparse automat matrices for each label
+  // vector of sparse automaton matrices for each label
   const std::vector<cuBool_Matrix> &automaton, const std::vector<cuBool_Index> &start_states,
-  // transposed matrices for graph and automat
+  // transposed matrices for graph and automaton
   const std::vector<cuBool_Matrix> &graph_transposed,
   const std::vector<cuBool_Matrix> &automaton_transposed,
 
@@ -16,7 +16,7 @@ cuBool_Matrix regular_path_query_with_transposed(
 cuBool_Matrix regular_path_query(
   // vector of sparse graph matrices for each label
   const std::vector<cuBool_Matrix> &graph, const std::vector<cuBool_Index> &source_vertices,
-  // vector of sparse automat matrices for each label
+  // vector of sparse automaton matrices for each label
   const std::vector<cuBool_Matrix> &automaton, const std::vector<cuBool_Index> &start_states,
 
   const std::vector<bool> &inversed_labels = {}, bool all_labels_are_inversed = false);

src/regular_path_query.cpp

@@ -38,7 +38,7 @@ cuBool_Matrix regular_path_query_with_transposed(
     }
   }
 
-  // get number of automat nodes
+  // get number of automaton nodes
   for (auto label_matrix : automaton) {
     if (label_matrix != nullptr) {
       cuBool_Matrix_Nrows(label_matrix, &automaton_nodes_number);
@@ -126,7 +126,7 @@ cuBool_Matrix regular_path_query_with_transposed(
 cuBool_Matrix regular_path_query(
   // vector of sparse graph matrices for each label
   const std::vector<cuBool_Matrix> &graph, const std::vector<cuBool_Index> &source_vertices,
-  // vector of sparse automat matrices for each label
+  // vector of sparse automaton matrices for each label
   const std::vector<cuBool_Matrix> &automaton, const std::vector<cuBool_Index> &start_states,
   // work with inverted labels
   const std::vector<bool> &inversed_labels_input, bool all_labels_are_inversed) {
@@ -153,7 +153,7 @@ cuBool_Matrix regular_path_query(
     assert(status == CUBOOL_STATUS_SUCCESS);
   }
 
-  // transpose automat matrices
+  // transpose automaton matrices
   std::vector<cuBool_Matrix> automaton_transposed;
   automaton_transposed.reserve(automaton.size());
   for (auto label_matrix : automaton) {

tests/rpq_tests.cpp

@@ -157,12 +157,6 @@ static std::string get_path(std::string_view file) {
 
 TEST(RPQ, Tests) {
   std::vector<Config> configs {
-    {
-      .graph_data = {get_path("5/graph_a.mtx"), get_path("5/graph_b.mtx")},
-      .automaton_data = {get_path("5/automat_a.mtx"), get_path("5/automat_b.mtx")},
-      .sources = {1},
-      .expexted = get_path("5/expected.txt"),
-    },
     {
       .graph_data = {get_path("a.mtx"), get_path("b.mtx")},
       .automaton_data {get_path("1/a.mtx"), ""},
@@ -187,6 +181,12 @@ TEST(RPQ, Tests) {
       .sources = {4},
       .expexted = get_path("4/expected.txt"),
     },
+    {
+      .graph_data = {get_path("5/graph_a.mtx"), get_path("5/graph_b.mtx")},
+      .automaton_data = {get_path("5/automaton_a.mtx"), get_path("5/automaton_b.mtx")},
+      .sources = {1},
+      .expexted = get_path("5/expected.txt"),
+    },
   };
 
   for (const auto &config : configs) {