Package org.apache.flink.graph.asm.degree.annotate

The degree annotation package provides a collection of edge-centric graph algorithms for counting the vertex degree of directed and undirected graphs.

See: Description

Class Summary

Class	Description
DegreeAnnotationFunctions	Common user-defined-functions.
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 in-degree 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.

Package org.apache.flink.graph.asm.degree.annotate Description

The degree annotation package provides a collection of edge-centric graph algorithms for counting the vertex degree of directed and undirected graphs.

Undirected graphs have the property that for every vertex the in-degree is equivalent to the out-degree.

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 out-edge in(x) is the number of vertex neighbors connected by an in-edge

(out(x) + in(x)) / 2 <= deg(x) <= out(x) + in(x)