Add Memgraph v3.13.0

pages/advanced-algorithms.mdx

@@ -30,7 +30,7 @@ Dynamic graph algorithms are a part of [Memgraph Enterprise
 license](/database-management/enabling-memgraph-enterprise). 
 
 For more algorithms, check the **Memgraph Advanced Graph Extensions** (**MAGE**)
-library. It is part of the [Memgraph GitHub repository](https://github.com/memgraph/memgraph/tree/master/mage)
+library. It is part of the [Memgraph GitHub repository](https://github.com/memgraph/memgraph/tree/master/src/mage)
 that contains [graph algorithms](/advanced-algorithms/available-algorithms)
 written by the team behind Memgraph and its users in the form of query modules.
 The project aims to give everyone the tools they need to tackle the most

pages/advanced-algorithms/available-algorithms.mdx

@@ -112,6 +112,7 @@ If you want to know more and learn how this affects you, read our [announcement]
 | [periodic](/advanced-algorithms/available-algorithms/periodic)                           | C++    | A module containing procedures for periodically running difficult and/or memory/time consuming queries.                                                                                                                        |
 | [refactor](/advanced-algorithms/available-algorithms/refactor)                           | C++    | The refactor module provides utilities for changing nodes and relationships.                                                                                                                                                   |
 | [rust_example](https://github.com/memgraph/memgraph/tree/master/mage/rust/rsmgp-example)            | Rust   | Example of a basic module with input parameters forwarding, made in Rust.                                                                                                                                                      |
+| [search](/advanced-algorithms/available-algorithms/search)                               | C++    | A module for finding nodes by comparing one or more of their properties against a value with a comparison operator, without writing the equivalent `MATCH` and `WHERE` clauses.                                                |
 | [set_property](/advanced-algorithms/available-algorithms/set_property)                   | C++    | A module for dynamical access and editing of node and relationship properties.                                                                                                                                                 |
 | [temporal](/advanced-algorithms/available-algorithms/temporal)                           | Python | A module that provides functions to handle temporal (time-related) operations and offers extended capabilities compared to the date module.                                                                                    |
 | [text](/advanced-algorithms/available-algorithms/text)                                   | C++    | The `text` module offers a toolkit for manipulating strings.                                                                                                                                                                   |
@@ -173,9 +174,23 @@ Running `SHOW QUERY CALLABLE MAPPINGS` requires the `CONFIG` privilege.
 | apoc.coll.toSet | Converts the input list to a set | [collections.to_set()](/advanced-algorithms/available-algorithms/collections#to_set) |
 | apoc.coll.sum | Calculates the sum of listed elements | [collections.sum()](/advanced-algorithms/available-algorithms/collections#sum) |
 | apoc.coll.partition | Partitions the input list into sub-lists of the specified size | [collections.partition()](/advanced-algorithms/available-algorithms/collections#partition) |
+| apoc.coll.sort | Sorts the elements of an input list of the same data type | [collections.sort()](/advanced-algorithms/available-algorithms/collections#sort) |
+| apoc.coll.containsSorted | Verifies the presence of an element in a sorted list | [collections.contains_sorted()](/advanced-algorithms/available-algorithms/collections#contains_sorted) |
+| apoc.coll.containsAll | Checks if a list contains all the values from another list | [collections.contains_all()](/advanced-algorithms/available-algorithms/collections#contains_all) |
+| apoc.coll.intersection | Returns the unique intersection of two lists | [collections.intersection()](/advanced-algorithms/available-algorithms/collections#intersection) |
+| apoc.coll.disjunction | Returns the symmetric difference of two lists (elements in exactly one) | [collections.disjunction()](/advanced-algorithms/available-algorithms/collections#disjunction) |
+| apoc.coll.subtract | Returns the first list with the elements of the second removed, deduplicated | [collections.subtract()](/advanced-algorithms/available-algorithms/collections#subtract) |
+| apoc.coll.duplicates | Returns the values that appear more than once in a list | [collections.duplicates()](/advanced-algorithms/available-algorithms/collections#duplicates) |
+| apoc.coll.sumLongs | Calculates the sum of list elements cast to integers | [collections.sum_longs()](/advanced-algorithms/available-algorithms/collections#sum_longs) |
+| apoc.coll.avg | Calculates the average of listed elements | [collections.avg()](/advanced-algorithms/available-algorithms/collections#avg) |
+| apoc.coll.max | Returns the maximum-value element of the input list | [collections.max()](/advanced-algorithms/available-algorithms/collections#max) |
+| apoc.coll.min | Returns the minimum-value element of the input list | [collections.min()](/advanced-algorithms/available-algorithms/collections#min) |
+| apoc.coll.split | Splits the provided list based on a specified delimiter | [collections.split()](/advanced-algorithms/available-algorithms/collections#split) |
 | apoc.convert.toTree | Converts values into tree structures | [convert_c.to_tree()](/advanced-algorithms/available-algorithms/convert_c#to_tree) |
-| apoc.convert.fromJsonList | Converts a JSON string representation of a list into an actual list object | [json_util.from_json_list()](/advanced-algorithms/available-algorithms/json_util#from_json_list) |
-| apoc.convert.toJson | Converts any value to its JSON string representation | [json_util.to_json()](/advanced-algorithms/available-algorithms/json_util#to_json) |
+| apoc.convert.fromJsonList | Converts a JSON string representation of a list into an actual list object | [convert.from_json_list()](/advanced-algorithms/available-algorithms/convert#from_json_list) |
+| apoc.convert.fromJsonMap | Converts a JSON string representation of a map into an actual map object | [convert.from_json_map()](/advanced-algorithms/available-algorithms/convert#from_json_map) |
+| apoc.convert.toJson | Converts any value to its JSON string representation | [convert.to_json()](/advanced-algorithms/available-algorithms/convert#to_json) |
+| apoc.convert.toMap | Converts a value into a map | [convert.to_map()](/advanced-algorithms/available-algorithms/convert#to_map) |
 | apoc.create.node | Creates a single node with specified labels and properties | [create.node()](/advanced-algorithms/available-algorithms/create#node) |
 | apoc.create.nodes | Creates multiple nodes with specified labels and properties | [create.nodes()](/advanced-algorithms/available-algorithms/create#nodes) |
 | apoc.create.removeProperties | Removes properties from nodes | [create.remove_properties()](/advanced-algorithms/available-algorithms/create#remove_properties) |
@@ -202,12 +217,15 @@ Running `SHOW QUERY CALLABLE MAPPINGS` requires the `CONFIG` privilege.
 | apoc.refactor.renameType | Changes the relationship type | [refactor.rename_type()](/advanced-algorithms/available-algorithms/refactor#rename_type) |
 | apoc.refactor.rename.typeProperty | Renames the property of a relationship | [refactor.rename_type_property()](/advanced-algorithms/available-algorithms/refactor#rename_type_property) |
 | apoc.refactor.mergeNodes | Merges properties, labels and relationships for source nodes to target node | [refactor.mergeNodes()](/advanced-algorithms/available-algorithms/refactor#mergenodes) |
+| apoc.search.node | Finds nodes by a label-property map and comparison operator, returning each matching node once | [search.node()](/advanced-algorithms/available-algorithms/search#node) |
+| apoc.search.nodeAll | Finds nodes by a label-property map and comparison operator, returning one row per matching property | [search.node_all()](/advanced-algorithms/available-algorithms/search#node_all) |
 | apoc.text.join | Joins all strings into a single one with given delimiter | [text.join()](/advanced-algorithms/available-algorithms/text#join) |
 | apoc.text.indexOf | Finds the index of first occurrence of a substring within a string | [text.indexOf()](/advanced-algorithms/available-algorithms/text#indexof) |
 | apoc.text.regexGroups | Returns all matched subexpressions of regex on provided text | [text.regexGroups()](/advanced-algorithms/available-algorithms/text#regexgroups) |
 | apoc.text.format | Formats strings using the C++ fmt library | [text.format()](/advanced-algorithms/available-algorithms/text#format) |
 | apoc.text.replace | Replaces substrings matching regex with replacement | [text.replace()](/advanced-algorithms/available-algorithms/text#replace) |
 | apoc.text.regReplace | Replaces substrings matching regex with replacement | [text.regReplace()](/advanced-algorithms/available-algorithms/text#regreplace) |
+| apoc.text.compareCleaned | Compares two strings for equality after normalization | [text.compare_cleaned()](/advanced-algorithms/available-algorithms/text#compare_cleaned) |
 | apoc.util.md5 | Gets MD5 hash of concatenated string representations | [util_module.md5()](/advanced-algorithms/available-algorithms/util_module#md5) |
 | apoc.util.validatePredicate | Raises exception if predicate yields true with parameter interpolation | [mgps.validate_predicate()](/advanced-algorithms/available-algorithms/mgps#validate_predicate) |
 | db.awaitIndexes | No-op compatibility shim for clients that wait for index creation (e.g. the Neo4j Spark connector) | [mgps.await_indexes()](/advanced-algorithms/available-algorithms/mgps#await_indexes) |

pages/advanced-algorithms/available-algorithms/_meta.ts

@@ -59,6 +59,7 @@ export default {
   "path": "path",
   "periodic": "periodic",
   "refactor": "refactor",
+  "search": "search",
   "set_cover": "set_cover",
   "set_property": "set_property",
   "temporal": "temporal",

pages/advanced-algorithms/available-algorithms/algo.mdx

@@ -16,7 +16,7 @@ enabling users to perform complex graph-based operations and computations, such
   <Cards.Card
     icon={<GitHub />}
     title="Source code"
-    href="https://github.com/memgraph/memgraph/blob/master/mage/cpp/algo_module/algo_module.cpp"
+    href="https://github.com/memgraph/memgraph/blob/master/src/mage/cpp/algo_module/algo_module.cpp"
   />
 </Cards>
 

pages/advanced-algorithms/available-algorithms/betweenness_centrality.mdx

@@ -28,7 +28,7 @@ Centrality"](http://www.uvm.edu/pdodds/research/papers/others/2001/brandes2001a.
   <Cards.Card
     icon={<GitHub />}
     title="Source code"
-    href="https://github.com/memgraph/memgraph/blob/master/mage/cpp/betweenness_centrality_module/betweenness_centrality_module.cpp"
+    href="https://github.com/memgraph/memgraph/blob/master/src/mage/cpp/betweenness_centrality_module/betweenness_centrality_module.cpp"
   />
 </Cards>
 

pages/advanced-algorithms/available-algorithms/betweenness_centrality_online.mdx

@@ -48,7 +48,7 @@ reflective of real-time changes.
   <Cards.Card
     icon={<GitHub />}
     title="Source code"
-    href="https://github.com/memgraph/memgraph/blob/master/mage/cpp/betweenness_centrality_module/betweenness_centrality_online_module.cpp"
+    href="https://github.com/memgraph/memgraph/blob/master/src/mage/cpp/betweenness_centrality_module/betweenness_centrality_online_module.cpp"
   />
 </Cards>
 

pages/advanced-algorithms/available-algorithms/biconnected_components.mdx

@@ -21,7 +21,7 @@ The algorithm works by finding articulation points, and then traversing from the
   <Cards.Card
     icon={<GitHub />}
     title="Source code"
-    href="https://github.com/memgraph/memgraph/blob/master/mage/cpp/biconnected_components_module/biconnected_components_module.cpp"
+    href="https://github.com/memgraph/memgraph/blob/master/src/mage/cpp/biconnected_components_module/biconnected_components_module.cpp"
   />
 </Cards>
 

pages/advanced-algorithms/available-algorithms/bipartite_matching.mdx

@@ -23,7 +23,7 @@ set of edges (relationships).
   <Cards.Card
     icon={<GitHub />}
     title="Source code"
-    href="https://github.com/memgraph/memgraph/blob/master/mage/cpp/bipartite_matching_module/bipartite_matching_module.cpp"
+    href="https://github.com/memgraph/memgraph/blob/master/src/mage/cpp/bipartite_matching_module/bipartite_matching_module.cpp"
   />
 </Cards>
 

pages/advanced-algorithms/available-algorithms/bridges.mdx

@@ -20,7 +20,7 @@ valuable to detect it on time.
   <Cards.Card
     icon={<GitHub />}
     title="Source code"
-    href="https://github.com/memgraph/memgraph/blob/master/mage/cpp/bridges_module/bridges_module.cpp"
+    href="https://github.com/memgraph/memgraph/blob/master/src/mage/cpp/bridges_module/bridges_module.cpp"
   />
 </Cards>