The fastest to run any graph algorithm on your data is by using Memgraph and MAGE. It’s super easy. Download Memgraph, import your data, pick one of the most popular graph algorithms, and start crunching the numbers.
Memgraph is an in-memory graph database. You can use it to traverse networks and run sophisticated graph algorithms out-of-the-box.
MAGE is an open-source repository tool supported by Memgraph. MAGE carries different modules and graph algorithms in the form of query modules.
You can choose from 19 graph algorithms along with their GitHub repositories for your query modules. You can use these algorithms with Memgraph and Mage immediately.
In today’s era of highly developed information systems, one of the key tasks is to seek out the shortest path in the network – from the beginning point to the endpoint. In his book: “Shortest Path Algorithms”, F.B. Zahn argues that testing and implementing algorithms to find the shortest paths in a network is one of the most important items to address and deal with potential issues.
Here are some examples of using several of the foremost well-known algorithms for locating the shortest paths: Dijkstra’s Algorithm, Bellman-Ford Algorithm, Floyd-Warshall Algorithm, and Johnson’s Algorithm.
Read more on Memgraph blog.
The Cypher Email Course is back! A few months ago, we created a free 10-day email course to learn the basics of Cypher - the query language used by Memgraph. It was unavailable for a short time as we updated our website and newsletter, but now it's back.
As for the lessons, you will receive the following material:
Sign up for the Cypher Email Course! It’s free!
If you, or someone awesome you know, want to help us build the future of graph apps, check out our open positions below. 👇
Find all open positions here.
If you'd like to give Memgraph a spin, you can download it for free.
That's it for today. Have a great weekend and until next time!
– The Memgraph Team