Ultipa offers a rich collection of graph algorithms designed for analytical insights from graph data. Algorithms can be executed with both GQL and UQL.
How to Run Algorithms
To achieve optimal performance, it is essential to create either HDC graphs or distributed projections for the graphsets. Algorithms should be run on an HDC graph or distributed projection, rather than directly on the original graphset.
For more information, see:
All algorithms can be run on HDC graphs, and some support distributed projections. Each algorithm page displays the following tags:
HDC - The algorithm has HDC version.
Distributed - The algorithm has distributed version.
How to Install Algorithms
Algorithms for HDC and distributed version are managed differently. For more details, see Installing Algorithms.
All Algorithms
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
- Algorithms
- Background Knowledge