Class | Description |
---|---|
BreadthFirstSearch<K,EV> |
Adapted from the Graphalytics implementation.
|
ConnectedComponents<EV> | |
LabelPropagation<EV> | |
LocalClusteringCoefficient |
Adapted from the Graphalytics implementation.
|
LocalClusteringCoefficient.LCCMessage | |
MultipleSourceShortestPaths | |
PageRank<K> | |
SingleSourceShortestPaths | |
SybilRank |
This is an implementation of the SybilRank algorithm.
|
SybilRank.SybilRankComputation |
This class implements the main part of the SybilRank algorithms, that is,
the power iterations.
|
SybilRank.TrustAggregation |
This computation class is used to calculate the aggregate number of
trusted nodes.
|
SybilRank.VertexValue |
Represents the state of a vertex for this algorithm.
|
Enum | Description |
---|---|
GraphAlgorithmType |
Copyright © 2020. All rights reserved.