| Class | Description |
|---|---|
| ConnectedComponents |
Connected components algorithm.
|
| LabelPropagation |
Label Propagation algorithm.
|
| PageRank |
PageRank algorithm implementation.
|
| ShortestPaths |
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.
|
| StronglyConnectedComponents |
Strongly connected components algorithm implementation.
|
| SVDPlusPlus |
Implementation of SVD++ algorithm.
|
| SVDPlusPlus.Conf |
Configuration parameters for SVDPlusPlus.
|
| TriangleCount |
Compute the number of triangles passing through each vertex.
|