Driver program for running graph algorithms.
Connected components algorithm.
Label Propagation algorithm.
PageRank algorithm implementation.
Implementation of SVD++ algorithm.
Computes shortest paths to the given set of landmark vertices, returning a graph where each vertex attribute is a map containing the shortest-path distance to each reachable landmark.
Strongly connected components algorithm implementation.
Compute the number of triangles passing through each vertex.