[main < T- degree] Implement node in out degree

cpp/node_module/algorithm/node.cpp

@@ -177,3 +177,55 @@ void Node::RelationshipTypes(mgp_list *args, mgp_graph *memgraph_graph, mgp_resu
     return;
   }
 }
+
+void Node::DegreeIn(mgp_list *args, mgp_func_context *ctx, mgp_func_result *res, mgp_memory *memory) {
+  mgp::MemoryDispatcherGuard guard{memory};
+  const auto arguments = mgp::List(args);
+  auto result = mgp::Result(res);
+  try {
+    const auto node = arguments[0].ValueNode();
+    const auto type = arguments[1].ValueString();
+    if (type.size() == 0) {
+      result.SetValue((int64_t)node.InDegree());
+      return;
+    }
+    int64_t degree = 0;
+    for (const auto rel : node.InRelationships()) {
+      if (rel.Type() == type) {
+        degree += 1;
+      }
+    }
+    result.SetValue(degree);
+
+
+  } catch (const std::exception &e) {
+    result.SetErrorMessage(e.what());
+    return;
+  }
+}
+
+void Node::DegreeOut(mgp_list *args, mgp_func_context *ctx, mgp_func_result *res, mgp_memory *memory) {
+  mgp::MemoryDispatcherGuard guard{memory};
+  const auto arguments = mgp::List(args);
+  auto result = mgp::Result(res);
+  try {
+    const auto node = arguments[0].ValueNode();
+    const auto type = arguments[1].ValueString();
+    if (type.size() == 0) {
+      result.SetValue((int64_t)node.OutDegree());
+      return;
+    } 
+    int64_t degree = 0;
+    for (const auto rel : node.OutRelationships()) {
+      if (rel.Type() == type) {
+        degree += 1;
+      }
+    }
+    result.SetValue(degree);
+
+
+  } catch (const std::exception &e) {
+    result.SetErrorMessage(e.what());
+    return;
+  }
+}

cpp/node_module/algorithm/node.hpp

@@ -25,6 +25,16 @@ constexpr std::string_view kRelationshipTypesArg1 = "node";
 constexpr std::string_view kRelationshipTypesArg2 = "types";
 constexpr std::string_view kResultRelationshipTypes = "relationship_types";
 
+/* degree_in constants */
+constexpr std::string_view kFunctionDegreeIn = "degree_in";
+constexpr std::string_view kDegreeInArg1 = "node";
+constexpr std::string_view kDegreeInArg2 = "type";
+
+/* degree_out constants */
+constexpr std::string_view kFunctionDegreeOut = "degree_out";
+constexpr std::string_view kDegreeOutArg1 = "node";
+constexpr std::string_view kDegreeOutArg2 = "type";
+
 void RelationshipsExist(mgp_list *args, mgp_graph *memgraph_graph, mgp_result *result, mgp_memory *memory);
 
 bool RelationshipExist(const mgp::Node &node, std::string &rel_type);
@@ -35,4 +45,8 @@ void RelationshipExists(mgp_list *args, mgp_graph *memgraph_graph, mgp_result *r
 
 void RelationshipTypes(mgp_list *args, mgp_graph *memgraph_graph, mgp_result *result, mgp_memory *memory);
 
+void DegreeIn(mgp_list *args, mgp_func_context *ctx, mgp_func_result *res, mgp_memory *memory);
+
+void DegreeOut(mgp_list *args, mgp_func_context *ctx, mgp_func_result *res, mgp_memory *memory);
+
 }  // namespace Node

cpp/node_module/node_module.cpp

@@ -4,7 +4,9 @@
 
 extern "C" int mgp_init_module(struct mgp_module *module, struct mgp_memory *memory) {
   try {
-    mgp::MemoryDispatcherGuard guard{memory};;
+
+    mgp::MemoryDispatcherGuard guard{memory};
+
     AddProcedure(Node::RelationshipsExist, std::string(Node::kProcedureRelationshipsExist).c_str(),
                  mgp::ProcedureType::Read,
                  {mgp::Parameter(std::string(Node::kArgumentNodesRelationshipsExist).c_str(), mgp::Type::Node),
@@ -25,6 +27,16 @@ extern "C" int mgp_init_module(struct mgp_module *module, struct mgp_memory *mem
          mgp::Parameter(Node::kRelationshipTypesArg2, {mgp::Type::List, mgp::Type::String}, mgp::Value(mgp::List{}))},
         {mgp::Return(Node::kResultRelationshipTypes, {mgp::Type::List, mgp::Type::String})}, module, memory);
 
+    mgp::AddFunction(Node::DegreeIn, Node::kFunctionDegreeIn,
+                     {mgp::Parameter(Node::kDegreeInArg1, mgp::Type::Node),
+                      mgp::Parameter(Node::kDegreeInArg2, mgp::Type::String, "")},
+                     module, memory);
+
+    mgp::AddFunction(Node::DegreeOut, Node::kFunctionDegreeOut,
+                     {mgp::Parameter(Node::kDegreeOutArg1, mgp::Type::Node),
+                      mgp::Parameter(Node::kDegreeOutArg2, mgp::Type::String, "")},
+                     module, memory);
+
   } catch (const std::exception &e) {
     return 1;
   }

e2e/node_test/test_degree_in1/input.cyp

@@ -0,0 +1 @@
+CREATE (d:Dog),(h:Human),(d)-[l:LOVES]->(h),(d)-[o:OWNED_BY]->(h);

e2e/node_test/test_degree_in1/test.yml

@@ -0,0 +1,5 @@
+query: >
+  MATCH (h:Human) RETURN node.degree_in(h, "LOVES") AS result;
+
+output:
+  - result: 1

e2e/node_test/test_degree_in2/input.cyp

@@ -0,0 +1 @@
+CREATE (d:Dog),(h:Human),(d)-[l:LOVES]->(h),(d)-[o:OWNED_BY]->(h);

e2e/node_test/test_degree_in2/test.yml

@@ -0,0 +1,5 @@
+query: >
+  MATCH (h:Human) RETURN node.degree_in(h) AS result;
+
+output:
+  - result: 2

e2e/node_test/test_degree_in3/input.cyp

@@ -0,0 +1 @@
+MERGE (d:Dog {name: "Rex"}) WITH d UNWIND range(0, 1000) AS id MERGE (h:Human {name: "Humie" + id}) MERGE (h)-[l:LOVES]->(d);

e2e/node_test/test_degree_in3/test.yml

@@ -0,0 +1,5 @@
+query: >
+  MATCH (d:Dog) RETURN node.degree_in(d) AS result;
+
+output:
+  - result: 1001

e2e/node_test/test_degree_out1/input.cyp

@@ -0,0 +1 @@
+CREATE (d:Dog),(h:Human),(d)-[l:LOVES]->(h),(d)-[o:OWNED_BY]->(h);

e2e/node_test/test_degree_out1/test.yml

@@ -0,0 +1,5 @@
+query: >
+  MATCH (d:Dog) RETURN node.degree_out(d, "LOVES") AS result;
+
+output:
+  - result: 1

e2e/node_test/test_degree_out2/input.cyp

@@ -0,0 +1 @@
+CREATE (d:Dog),(h:Human),(d)-[l:LOVES]->(h),(d)-[o:OWNED_BY]->(h);

e2e/node_test/test_degree_out2/test.yml

@@ -0,0 +1,5 @@
+query: >
+  MATCH (d:Dog) RETURN node.degree_out(d) AS result;
+
+output:
+  - result: 2

e2e/node_test/test_degree_out3/input.cyp

@@ -0,0 +1 @@
+MERGE (d:Dog {name: "Rex"}) WITH d UNWIND range(0, 1000) AS id MERGE (h:Human {name: "Humie" + id}) MERGE (d)-[l:LOVES]->(h);

e2e/node_test/test_degree_out3/test.yml

@@ -0,0 +1,5 @@
+query: >
+  MATCH (d:Dog) RETURN node.degree_out(d) AS result;
+
+output:
+  - result: 1001