Playground goes beyond case studies: learn which graph algos to use with your streams, master graph algorithms in minutes and get a jump start on your graph stream project.
Find /r/worldnews subreddit's most prominent redditors. The dataset is constantly updated with new data. The dataset lives in a Memgraph instance that is connected to a Kafka stream which brings live /r/worldnews data to our dataset.
The PageRank algorithm is a method of measuring the importance of nodes by analyzing the quantity and quality of the links that point to them. Google uses this algorithm to rank search results but it can also be used for developing recommendation systems, influence analysis, and much more.
Groups of densely connected nodes are easy to spot visually, but more sophisticated methods are needed to perform these tasks programmatically. Community detection algorithms are used to find such groups of densely connected components in various networks.
A very common use case for community detection algorithms is social network analysis where the algorithms are used to identify groups of users based on interactions.
Breadth-First Search (BFS) is a way of traversing graph data structures. The traversal starts from a single node and, during the traversal, breadth is prioritized over depth, hence the name of the algorithm. This algorithm can be used to solve many problems including pathfinding and cycle detection.