Memgraph 3.5

next-env.d.ts

@@ -1,5 +1,6 @@
 /// <reference types="next" />
 /// <reference types="next/image-types/global" />
+/// <reference path="./.next/types/routes.d.ts" />
 
 // NOTE: This file should not be edited
 // see https://nextjs.org/docs/pages/api-reference/config/typescript for more information.

pages/advanced-algorithms.mdx

@@ -13,11 +13,11 @@ If you require procedures designed to solve specific graph problems, there is a
 number of advanced algorithms available in Memgraph.
 
 [BFS](/advanced-algorithms/deep-path-traversal#breadth-first-search),
-[DFS](/advanced-algorithms/deep-path-traversal#depth-first-search),
-[Weighted shortest
-path](/advanced-algorithms/deep-path-traversal#weighted-shortest-path),
+[DFS](/advanced-algorithms/deep-path-traversal#depth-first-search), [Weighted
+shortest path](/advanced-algorithms/deep-path-traversal#weighted-shortest-path),
 [All shortest
-paths](/advanced-algorithms/deep-path-traversal#all-shortest-paths) are
+paths](/advanced-algorithms/deep-path-traversal#all-shortest-paths) and [K
+shortest paths](/advanced-algorithms/deep-path-traversal#k-shortest-paths) are
 built-in deep path traversal algorithms you can run using their specific
 clauses. 
 

pages/advanced-algorithms/available-algorithms.mdx

@@ -22,6 +22,7 @@ library](/advanced-algorithms/install-mage).
 | [Breadth-first search](/advanced-algorithms/deep-path-traversal#breadth-first-search)     | C++  | An algorithm for traversing through a graph starting based on nodes' breadth (distance from the source node).                                                                                                                                  |
 | [Weighted shortest path](/advanced-algorithms/deep-path-traversal#weighted-shortest-path) | C++  | The weighted shortest path problem is the problem of finding a path between two nodes in a graph such that the sum of the weights of relationships connecting nodes, or the sum of the weight of some node property on the path, is minimized. |
 | [All shortest paths](/advanced-algorithms/deep-path-traversal#all-shortest-paths)         | C++  | Finding all shortest paths is an expansion of the weighted shortest paths problem. The goal of finding the shortest path is obtaining any minimum sum of weights on the path from one node to the other.                                       |
+| [K shortest paths](/advanced-algorithms/deep-path-traversal#k-shortest-paths)             | C++  | Returning K shortest paths between 2 nodes in order of shortest to longest paths.                                                                                                                                                              |
 
 ## Traditional graph algorithms
 
@@ -84,6 +85,7 @@ If you want to know more and learn how this affects you, read our [announcement]
 | Algorithms                                                                               | Lang   | Description                                                                                                                                                                                                                    |
 |------------------------------------------------------------------------------------------|--------|--------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|
 | [collections](/advanced-algorithms/available-algorithms/collections)                     | C++    | The collections module is a collection manipulation module that offers functions to work with lists in Cypher queries, allowing operations like filtering, sorting, and modification for efficient data handling.              |
+| [convert](/advanced-algorithms/available-algorithms/convert)                             | C++    | The convert module is a data transformation module that offers functions to convert various data structures into different formats, allowing operations like data type transformation and structural modifications for efficient data handling. |
 | [create](/advanced-algorithms/available-algorithms/create)                               | C++    | The create module is a set of powerful tools that provide additional capabilities for creating nodes and relationships in the Memgraph graph database.                                                                         |
 | [csv_utils](/advanced-algorithms/available-algorithms/csv_utils)                         | C++    | An utility module for creating and deleting CSV files.                                                                                                                                                                          |
 | [date](/advanced-algorithms/available-algorithms/date)                                   | Python | The `date` module provides various utilities to handle date and time operations within the Cypher query language.                                                                                                              |
@@ -96,6 +98,7 @@ If you want to know more and learn how this affects you, read our [announcement]
 | [label](/advanced-algorithms/available-algorithms/label)                                 | C++    | The `label` module provides an array of utilities for working with labels.                                                                                                                                                     |
 | [llm_util](/advanced-algorithms/available-algorithms/llm_util)                           | Python | **Deprecated**. A module that contains procedures describing graphs in a format best suited for large language models (LLMs).                                                                                                                  |
 | [map](/advanced-algorithms/available-algorithms/map)                                     | C++    | The map module offers a versatile toolkit for manipulating collections of key-value pairs, enabling advanced data operations within a graph database context                                                                   |
+| [math](/advanced-algorithms/available-algorithms/math)                                   | C++    | A general math query module providing mathematical operations and utilities.                                                                                                                                                   |
 | [merge](/advanced-algorithms/available-algorithms/merge)                                 | C++    | A module which provides the capabilities of the `MERGE` Cypher command, merging or creating nodes and relationships as per specified conditions. It ensures precision and coherence in managing interconnected data structure. |
 | [meta](/advanced-algorithms/available-algorithms/meta)                                   | C++    | Provides information about graph nodes and relationships.                                                                                                                                                                      |
 | [meta_util](/advanced-algorithms/available-algorithms/meta_util)                         | Python | A module that contains procedures describing graphs on a meta-level.                                                                                                                                                           |
@@ -123,3 +126,55 @@ If you want to know more and learn how this affects you, read our [announcement]
 | [elasticsearch](/advanced-algorithms/available-algorithms/elasticsearch_synchronization) | Python | A module used for synchronizing Memgraph and Elasticsearch.                                                                            |
 | [igraph](/advanced-algorithms/available-algorithms/igraphalg)                            | Python | A module that provides igraph integration with Memgraph and implements many igraph algorithms.                                         |
 | [nxalg](/advanced-algorithms/available-algorithms/nxalg)                                 | Python | A module that provides NetworkX integration with Memgraph and implements many NetworkX algorithms.                                     |
+
+
+## APOC mappings
+
+This table shows the mapping between APOC functions/procedures and their Memgraph equivalents. Use these mappings if you're familiar with Neo4j's APOC library.
+
+| APOC | Description | Memgraph equivalent |
+|-------------------------|-------------|---------------------|
+| apoc.coll.union | Unites two lists into one, eliminating duplicates | [collections.union()](/advanced-algorithms/available-algorithms/collections#union) |
+| apoc.coll.unionAll | Returns the union of two input lists, including duplicates | [collections.union_all()](/advanced-algorithms/available-algorithms/collections#union_all) |
+| apoc.coll.removeAll | Removes defined elements from the input list | [collections.remove_all()](/advanced-algorithms/available-algorithms/collections#remove_all) |
+| apoc.coll.contains | Verifies the existence of an input value in an input list | [collections.contains()](/advanced-algorithms/available-algorithms/collections#contains) |
+| apoc.coll.flatten | Returns flattened list of inputs provided | [collections.flatten()](/advanced-algorithms/available-algorithms/collections#flatten) |
+| apoc.coll.pairs | Creates pairs of neighbor elements within an input list | [collections.pairs()](/advanced-algorithms/available-algorithms/collections#pairs) |
+| 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.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.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) |
+| apoc.create.removeLabels | Removes labels from nodes | [create.remove_labels()](/advanced-algorithms/available-algorithms/create#remove_labels) |
+| apoc.date.convertFormat | Converts date strings between different formats | [date.convert_format()](/advanced-algorithms/available-algorithms/date#convert_format) |
+| apoc.label.exists | Checks if a label exists on a node | [label.exists()](/advanced-algorithms/available-algorithms/label#exists) |
+| apoc.map.removeKeys | Removes specified keys from a map | [map.remove_keys()](/advanced-algorithms/available-algorithms/map#remove_keys) |
+| apoc.map.merge | Merges multiple maps into one | [map.merge()](/advanced-algorithms/available-algorithms/map#merge) |
+| apoc.map.fromLists | Creates a map from two lists (keys and values) | [map.from_lists()](/advanced-algorithms/available-algorithms/map#from_lists) |
+| apoc.refactor.from | Redirects relationship to use a new start node | [refactor.from()](/advanced-algorithms/available-algorithms/refactor#from) |
+| apoc.refactor.to | Redirects relationship to use a new end node | [refactor.to()](/advanced-algorithms/available-algorithms/refactor#to) |
+| apoc.refactor.rename.label | Renames a label from old to new for all nodes | [refactor.rename_label()](/advanced-algorithms/available-algorithms/refactor#rename_label) |
+| apoc.refactor.rename.nodeProperty | Renames a property from old to new for all nodes | [refactor.rename_node_property()](/advanced-algorithms/available-algorithms/refactor#rename_node_property) |
+| apoc.refactor.cloneNodes | Clones specific nodes in the graph | [refactor.clone_nodes()](/advanced-algorithms/available-algorithms/refactor#clone_nodes) |
+| apoc.refactor.cloneSubgraph | Clones the subgraph by cloning nodes and relationships | [refactor.clone_subgraph()](/advanced-algorithms/available-algorithms/refactor#clone_subgraph) |
+| apoc.refactor.cloneSubgraphFromPaths | Clones subgraph specified by a list of paths | [refactor.clone_subgraph_from_paths()](/advanced-algorithms/available-algorithms/refactor#clone_subgraph_from_paths) |
+| apoc.refactor.collapseNode | Collapses a node into a relationship | [refactor.collapse_node()](/advanced-algorithms/available-algorithms/refactor#collapse_node) |
+| apoc.refactor.invert | Inverts the direction of a given relationship | [refactor.invert()](/advanced-algorithms/available-algorithms/refactor#invert) |
+| apoc.refactor.normalizeAsBoolean | Normalizes properties to true/false values | [refactor.normalize_as_boolean()](/advanced-algorithms/available-algorithms/refactor#normalize_as_boolean) |
+| apoc.refactor.extractNode | Creates a node from a relationship | [refactor.extract_node()](/advanced-algorithms/available-algorithms/refactor#extract_node) |
+| apoc.refactor.deleteAndReconnect | Deletes nodes and reconnects remaining nodes | [refactor.delete_and_reconnect()](/advanced-algorithms/available-algorithms/refactor#delete_and_reconnect) |
+| 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.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.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) |

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

@@ -9,6 +9,8 @@ export default {
   "csv_utils": "csv_utils",
   "community_detection_online": "community_detection_online",
   "community_detection": "community_detection",
+  "convert": "convert",
+  "convert_c": "convert_c",
   "do": "do",
   "create": "create",
   "cugraph": "cugraph",
@@ -33,6 +35,7 @@ export default {
   "leiden_community_detection": "leiden_community_detection",
   "llm_util": "llm_util",
   "map": "map",
+  "math": "math",
   "max_flow": "max_flow",
   "merge": "merge",
   "meta_util": "meta_util",