Memgraph supports a large number of different algorithms. Some of them are built-in right into the core [1], others are part of the MAGE library [2]. In this blog post, I've covered those built-in algorithms. They belong to the group of deep path traversal algorithms: Depth-first search (DFS), Breadth-first search (BFS), Weighted Shortest Path (WSP), and All Shortest Paths (ASP).

Please let me know if you have any questions or comments, I'll be happy to engage in a conversation regarding graph database algos or anything on that topic.

[1] https://memgraph.com/docs/advanced-algorithms/deep-path-trav... [2] https://memgraph.com/docs/advanced-algorithms/available-algo...