See: Description
Class  Description 

DegreeAnnotationFunctions 
Common userdefinedfunctions.

DegreeAnnotationFunctions.DegreeCount<K> 
Combines the vertex degree count.

DegreeAnnotationFunctions.JoinEdgeDegreeWithVertexDegree<K,EV,D> 
Composes the vertex degree with this edge value.

DegreeAnnotationFunctions.JoinEdgeWithVertexDegree<K,EV,D> 
Assigns the vertex degree to this edge value.

DegreeAnnotationFunctions.JoinVertexWithVertexDegree<K,VV> 
Performs a left outer join to apply a zero count for vertices with out or indegree of zero.

DegreeAnnotationFunctions.MapEdgeToSourceId<K,EV> 
Emits the source vertex ID along with an initial count.

DegreeAnnotationFunctions.MapEdgeToTargetId<K,EV> 
Emits the target vertex ID along with an initial count.

Undirected graphs have the property that for every vertex the indegree is equivalent to the outdegree.
The undirected graph algorithms are: VertexDegree
annotates vertices as EdgeSourceDegree
annotates edges as EdgeTargetDegree
annotates edges as EdgeDegreePair
annotates edges as
The directed graph algorithms are: VertexDegrees
annotates vertices as VertexOutDegree
annotates vertices as VertexInDegree
annotates vertices as EdgeSourceDegrees
annotates edges as EdgeTargetDegrees
annotates edges as
EdgeDegreesPair
annotates edges as
where: EV is the original edge value deg(x) is the number of vertex neighbors out(x) is the number of vertex neighbors connected by an outedge in(x) is the number of vertex neighbors connected by an inedge
(out(x) + in(x)) / 2 <= deg(x) <= out(x) + in(x)
Copyright © 2014–2022 The Apache Software Foundation. All rights reserved.