Ultipa offers a rich set of graph algorithms designed for gaining analytical insights from graph data. These algorithms can be executed using both GQL and UQL.
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 a 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 - Indicates the algorithm supports an HDC version.
Distributed - Indicates the algorithm supports a distributed version.
Algorithms for HDC and distributed versions are managed differently. For more details, see Installing Algorithms.
The algorithms Ultipa provides are classified into the following categories:
