Release Note

Vitis Graph Library is an open-sourced Vitis library written in C++ for accelerating graph applications in a variety of use cases. It now covers a level of acceleration: the module level (L1), the pre-defined kernel level (L2) and the asynchronous software level (L3).

2022.1

• Add a new algorithm Maximal Independent Set.
• Enhanced Louvain Modularity. L2 Louvain Modularity is able to support large-scale graphs.
• Add a L3 API to divide huge graphs into multiple parts and add other data structures to support the Louvain Modularity on these parts.

2021.2

The algorithms implemented by Vitis Graph Library include:

• Similarity analysis: Cosine Similarity, Jaccard Similarity, k-nearest neighbor. From 2021.2, the ‘weight’ feature is supported for Cosin Similarity.
• Centrality analysis: PageRank.
• Pathfinding: Single Source Shortest Path (SSSP), Multi-Sources Shortest Path (MSSP).
• Connectivity analysis: Weekly Connected Components and Strongly Connected Components.
• Community Detection: Louvain Modularity, Label Propagation and Triangle Count.
• Search: Breadth First Search, 2-Hop Search
• Graph Format: Renumber(2021.2), Calculate Degree and Format Convert between CSR and CSC.