Ultipa offers a rich collection of graph algorithms designed for analytical insights from graph data.
Algorithms can be executed with both GQL and UQL, with the requirement of creating a graph projection for optimal efficiency. Here are the key steps:
- Projecting Graphs: Load the entire graph or specific subgraph into memory as a projection for computation.
- Installing Algorithms: Install the necessary algorithms for use.
- Running Algorithms: Execute algorithms on your projections with desired parameters and execution modes.
All algorithms can be run on HDC projections, while some also support distributed projections. Each algorithm page displays the following tags indicating the compatible projection types:
HDC - The algorithm can be run on HDC projections.
Distributed - The algorithm can be run on distributed projections.
The algorithms Ultipa provides are classified into the following categories:
- Centrality Algorithms
- Similarity algorithms
- Connectivity & Compactness Algorithms
- Pathfinding
- Topological Link Prediction
- Community Detection & Classification Algorithms
- Graph Embedding Algorithms