memgraph · matea16 · Nov 20, 2025 · Dec 16, 2025 · Jan 13, 2026 · Jan 20, 2026
@@ -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 an [open-source repository](https://github.com/memgraph/mage)
+library. It is part of the [Memgraph GitHub repository](https://github.com/memgraph/memgraph/tree/master/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
@@ -41,6 +41,12 @@ user-defined procedures, grouped into modules that extend the Cypher query
 language. Procedures are implementations of various algorithms in multiple
 programming languages and they are all runnable inside Memgraph.
 
+<Callout type="info">
+As of version 3.8.0, the [MAGE repository](https://github.com/memgraph/mage) is now part of the 
+[Memgraph GitHub repository](https://github.com/memgraph/memgraph) under the `mage` directory and 
+will be archived.
+</Callout>
+
 ## Quick start
 
 <Steps>
@@ -54,7 +60,7 @@ If you are using Linux, you can [install MAGE from
 source](/advanced-algorithms/install-mage#linux).
 
 <Callout type="info">
-We currently do not produce MAGE images with cuGraph (since version 1.3). If this is something you require, please raise an [issue](https://github.com/memgraph/mage/issues)
+We currently do not produce MAGE images with cuGraph (since version 1.3). If this is something you require, please raise an [issue](https://github.com/memgraph/memgraph/issues)
 </Callout>
 
 ### Load query modules
@@ -81,10 +87,13 @@ queries and tackle that graph analytics problem that's been keeping you awake.
 With changes in Memgraph API, MAGE started to track version numbers. Check out
 MAGE compatibility with Memgraph versions.
 
+<Callout type="info">
+For versions 3.0.0 and later, the MAGE version is the same as the Memgraph version.
+</Callout>
+
 | MAGE version | Memgraph version  |
 |--------------|-------------------|
-| 3.1          | 3.1               |
-| 3.0          | 3.0               | 
+| == Memgraph  | >=3.0               | 
 | 1.22         | 2.22              |
 | 1.22.1       | 2.22.1            |
 | 1.21         | 2.21              |

@@ -109,7 +109,7 @@ If you want to know more and learn how this affects you, read our [announcement]
 | [nodes](/advanced-algorithms/available-algorithms/nodes)                                 | C++    | A module that provides a comprehensive toolkit for managing multiple graph nodes, enabling linking, updating, type deduction and more.                                                                                         |
 | [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/mage/tree/main/rust/rsmgp-example)            | Rust   | Example of a basic module with input parameters forwarding, made in Rust.                                                                                                                                                      |
+| [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.                                                                                                                                                      |
 | [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.                                                                                                                                                                   |

@@ -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/mage/blob/main/cpp/algo_module/algo_module.cpp"
+    href="https://github.com/memgraph/memgraph/blob/master/mage/cpp/algo_module/algo_module.cpp"
   />
 </Cards>
 

@@ -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/mage/blob/main/cpp/betweenness_centrality_module/betweenness_centrality_module.cpp"
+    href="https://github.com/memgraph/memgraph/blob/master/mage/cpp/betweenness_centrality_module/betweenness_centrality_module.cpp"
   />
 </Cards>
 

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

@@ -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/mage/blob/main/cpp/biconnected_components_module/biconnected_components_module.cpp"
+    href="https://github.com/memgraph/memgraph/blob/master/mage/cpp/biconnected_components_module/biconnected_components_module.cpp"
   />
 </Cards>
 

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

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

@@ -20,7 +20,7 @@ using the `CALL` subclause.
   <Cards.Card
     icon={<GitHub />}
     title="Source code"
-    href="https://github.com/memgraph/mage/blob/main/cpp/collections_module/collections_module.cpp"
+    href="https://github.com/memgraph/memgraph/blob/master/mage/cpp/collections_module/collections_module.cpp"
   />
 </Cards>
 

@@ -32,7 +32,7 @@ preserving communities.
   <Cards.Card
     icon={<GitHub />}
     title="Source code"
-    href="https://github.com/memgraph/mage/blob/main/cpp/community_detection_module/community_detection_module.cpp"
+    href="https://github.com/memgraph/memgraph/blob/master/mage/cpp/community_detection_module/community_detection_module.cpp"
   />
 </Cards>
 

@@ -21,7 +21,7 @@ Functions in the collection are called inline.
   <Cards.Card
     icon={<GitHub />}
     title="Source code"
-    href="https://github.com/memgraph/mage/blob/main/cpp/convert_module/convert.cpp"
+    href="https://github.com/memgraph/memgraph/blob/master/query_modules/convert.cpp"
   />
 </Cards>
 

@@ -22,7 +22,7 @@ using the `CALL` subclause.
   <Cards.Card
     icon={<GitHub />}
     title="Source code"
-    href="https://github.com/memgraph/mage/blob/main/cpp/convert_module/convert.c"
+    href="https://github.com/memgraph/memgraph/blob/master/query_modules/convert.c"
   />
 </Cards>
 

@@ -17,7 +17,7 @@ model, manipulate, and query complex graph data.
   <Cards.Card
     icon={<GitHub />}
     title="Source code"
-    href="https://github.com/memgraph/mage/blob/main/cpp/create_module/create_module.cpp"
+    href="https://github.com/memgraph/memgraph/blob/master/mage/cpp/create_module/create_module.cpp"
   />
 </Cards>
 

@@ -16,7 +16,7 @@ It allows users to create and delete CSV files directly from the database enviro
   <Cards.Card
     icon={<GitHub />}
     title="Source code"
-    href="https://github.com/memgraph/mage/blob/main/cpp/csv_utils_module/csv_utils_module.cpp"
+    href="https://github.com/memgraph/memgraph/blob/master/mage/cpp/csv_utils_module/csv_utils_module.cpp"
   />
 </Cards>
 

@@ -23,7 +23,7 @@ wrappers for most of the algorithms present in the
   <Cards.Card
     icon={<GitHub />}
     title="Source code"
-    href="https://github.com/memgraph/mage/tree/main/cpp/cugraph_module"
+    href="https://github.com/memgraph/memgraph/blob/master/mage/cpp/cugraph_module"
   />
 </Cards>
 

@@ -26,7 +26,7 @@ set of nodes (vertices) of the given graph.
   <Cards.Card
     icon={<GitHub />}
     title="Source code"
-    href="https://github.com/memgraph/mage/blob/main/cpp/cycles_module/cycles_module.cpp"
+    href="https://github.com/memgraph/memgraph/blob/master/mage/cpp/cycles_module/cycles_module.cpp"
   />
 </Cards>
 

@@ -20,7 +20,7 @@ Memgraph for managing time-based data.
   <Cards.Card
     icon={<GitHub />}
     title="Source code"
-    href="https://github.com/memgraph/mage/tree/main/python/date.py"
+    href="https://github.com/memgraph/memgraph/blob/master/query_modules/date.py"
   />
 </Cards>
 

@@ -25,7 +25,7 @@ a_{i,k}$ or in matrix form: $y = A 1$.
   <Cards.Card
     icon={<GitHub />}
     title="Source code"
-    href="https://github.com/memgraph/mage/blob/main/cpp/degree_centrality_module/degree_centrality_module.cpp"
+    href="https://github.com/memgraph/memgraph/blob/master/mage/cpp/degree_centrality_module/degree_centrality_module.cpp"
   />
 </Cards>
 

@@ -24,7 +24,7 @@ this:
   <Cards.Card
     icon={<GitHub />}
     title="Source code"
-    href="https://github.com/memgraph/mage/blob/main/cpp/distance_calculator/distance_calculator.cpp"
+    href="https://github.com/memgraph/memgraph/blob/master/mage/cpp/distance_calculator/distance_calculator.cpp"
   />
 </Cards>
 

@@ -18,7 +18,7 @@ that will control query execution.
   <Cards.Card
     icon={<GitHub />}
     title="Source code"
-    href="https://github.com/memgraph/mage/blob/main/cpp/do_module/do_module.cpp"
+    href="https://github.com/memgraph/memgraph/blob/master/mage/cpp/do_module/do_module.cpp"
   />
 </Cards>
 

@@ -49,7 +49,7 @@ create new ones with custom schema**. Indexing can be performed in two ways:
   <Cards.Card
     icon={<GitHub />}
     title="Source code"
-    href="https://github.com/memgraph/mage/blob/main/python/elastic_search_serialization.py"
+    href="https://github.com/memgraph/memgraph/blob/master/mage/python/elastic_search_serialization.py"
   />
 </Cards>
 

@@ -15,7 +15,7 @@ The embeddings module provides tools for calculating sentence embeddings on node
   <Cards.Card
     icon={<GitHub />}
     title="Source code"
-    href="https://github.com/memgraph/mage/blob/main/python/embeddings.py"
+    href="https://github.com/memgraph/memgraph/blob/master/mage/python/embeddings.py"
   />
 </Cards>
 

@@ -24,7 +24,7 @@ Currently, this module supports:
   <Cards.Card
     icon={<GitHub />}
     title="Source code"
-    href="https://github.com/memgraph/mage/blob/main/python/export_util.py"
+    href="https://github.com/memgraph/memgraph/blob/master/mage/python/export_util.py"
   />
 </Cards>
 

@@ -32,7 +32,7 @@ representations by aggregating the representations of node neighbors and their
 representation from the previous iteration. Such properties make **graph neural
 networks** a great tool for various problems we in Memgraph encounter. If your
 graph is evolving in time, check [TGN
-model](https://github.com/memgraph/mage/blob/main/python/tgn.py) that Memgraph
+model](https://github.com/memgraph/memgraph/blob/master/mage/python/tgn.py) that Memgraph
 engineers have already developed.
 
 In this includes the following features:
@@ -92,7 +92,7 @@ For the underlying **GNN** training Memgraph uses the [DGL library](https://gith
   <Cards.Card
     icon={<GitHub />}
     title="Source code"
-    href="https://github.com/memgraph/mage/blob/main/python/link_prediction.py"
+    href="https://github.com/memgraph/memgraph/blob/master/mage/python/link_prediction.py"
   />
 </Cards>
 

@@ -45,7 +45,7 @@ useful.
   <Cards.Card
     icon={<GitHub />}
     title="Source code"
-    href="https://github.com/memgraph/mage/blob/main/python/node_classification.py"
+    href="https://github.com/memgraph/memgraph/blob/master/mage/python/node_classification.py"
   />
 </Cards>
 
@@ -66,7 +66,7 @@ The basic node classification workflow is as follows:
 
 This **MAGE** module is still in its early stage. We intend to use it only for
 **exploring or learning** about node classification. If you want it to be production-ready, make sure
-to either open a **[GitHub issue](https://github.com/memgraph/mage/issues)** or
+to either open a **[GitHub issue](https://github.com/memgraph/memgraph/issues)** or
 drop us a comment on **[Discord](https://discord.gg/memgraph)**.
 
 </Callout>

@@ -38,7 +38,7 @@ The list of analytics that the module uses:
   <Cards.Card
     icon={<GitHub />}
     title="Source code"
-    href="https://github.com/memgraph/mage/blob/main/python/graph_analyzer.py"
+    href="https://github.com/memgraph/memgraph/blob/master/query_modules/graph_analyzer.py"
   />
 </Cards>
 

@@ -40,7 +40,7 @@ converging to local minimums too early.
   <Cards.Card
     icon={<GitHub />}
     title="Source code"
-    href="https://github.com/memgraph/mage/blob/main/python/graph_coloring.py"
+    href="https://github.com/memgraph/memgraph/blob/master/mage/python/graph_coloring.py"
   />
 </Cards>
 

@@ -18,7 +18,7 @@ manipulation tools to accelerate development.
   <Cards.Card
     icon={<GitHub />}
     title="Source code"
-    href="https://github.com/memgraph/mage/blob/main/cpp/graph_util_module/graph_util_module.cpp"
+    href="https://github.com/memgraph/memgraph/blob/master/mage/cpp/graph_util_module/graph_util_module.cpp"
   />
 </Cards>
 

@@ -18,7 +18,7 @@ stream the native database graph directly, significantly lowering memory usage.
   <Cards.Card
     icon={<GitHub />}
     title="Source code"
-    href="https://github.com/memgraph/mage/blob/main/python/igraphalg.py"
+    href="https://github.com/memgraph/memgraph/blob/master/mage/python/igraphalg.py"
   />
 </Cards>
 

@@ -18,7 +18,7 @@ supports the import of JSON and graphML file formats.
   <Cards.Card
     icon={<GitHub />}
     title="Source code"
-    href="https://github.com/memgraph/mage/blob/main/python/import_util.py"
+    href="https://github.com/memgraph/memgraph/blob/master/mage/python/import_util.py"
   />
 </Cards>