The Graph Analytics Toolkit aims to provide high performance, distributed tools for graph mining, for use in community detection, social network discovery, etc. See the documentation for more details.

The toolkit currently implements the following tools:

Triangle Counting

Two triangle counting program:

1. Undirected Triangle Counting: counts the total number of triangles in a graph, or the the number of triangles each vertex is in.
2. Directed Triangle Counting: Counts the number of types of triangles each vertex is in.

PageRank

A classical graph algorithm which assigns each vertex a numerical importance value based on random walk properties.

KCore Decomposition

Identifies a hierarchical ordering of the vertices in the graph, allowing discovery of the central components of the network.