K - graph ID type
VV - vertex value type
EV - edge value type
All Implemented Interfaces:
extends Comparable<K>,VV,EV> GraphAnalyticBase<K,VV,EV, VertexMetrics.Result>
Compute the following vertex metrics in a directed graph. - number of vertices - number of edges
- number of unidirectional edges - number of bidirectional edges - average degree - number of
triplets - maximum degree - maximum out degree - maximum in degree - maximum number of triplets
Nested Class Summary
Modifier and Type
Class and Description
Wraps vertex metrics.
Methods inherited from class java.lang.
Object clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
VertexMetrics< K, VV, EV> setIncludeZeroDegreeVertices(boolean includeZeroDegreeVertices)
By default only the edge set is processed for the computation of degree. When this flag is
set an additional join is performed against the vertex set in order to output vertices with a
degree of zero.
includeZeroDegreeVertices - whether to output vertices with a degree of zero
VertexMetrics< K, VV, EV> run( Graph< K, VV, EV> input)
processing must be terminated by an
than obtained via accumulators rather than returned by a
run GraphAnalytic< K extends Comparable< K>, VV, EV, VertexMetrics.Result>
run GraphAnalyticBase< K extends Comparable< K>, VV, EV, VertexMetrics.Result>
input - input graph
Copyright © 2014–2021 The Apache Software Foundation. All rights reserved.