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

Class VertexDegrees<K,VV,EV>

java.lang.Object

org.apache.flink.graph.utils.proxy.GraphAlgorithmDelegatingDataSet<K,VV,EV,Vertex<K,VertexDegrees.Degrees>>

org.apache.flink.graph.asm.degree.annotate.directed.VertexDegrees<K,VV,EV>

Type Parameters:

K - graph label type

VV - vertex value type

EV - edge value type

All Implemented Interfaces:

GraphAlgorithm<K,VV,EV,org.apache.flink.api.java.DataSet<Vertex<K,VertexDegrees.Degrees>>>

public class VertexDegrees<K,VV,EV>
extends GraphAlgorithmDelegatingDataSet<K,VV,EV,Vertex<K,VertexDegrees.Degrees>>

Annotates vertices of a directed graph with the degree, out-, and in-degree.

Nested Class Summary

Nested Classes

Modifier and Type	Class and Description
static class	VertexDegrees.Degrees Wraps the vertex degree, out-degree, and in-degree.

Constructor Summary

Constructors

Constructor and Description
VertexDegrees()

Method Summary

Modifier and Type	Method and Description
protected String	getAlgorithmName() Algorithms are identified by name rather than by class to allow subclassing.
protected boolean	mergeConfiguration(GraphAlgorithmDelegatingDataSet other) An algorithm must first test whether the configurations can be merged before merging individual fields.
org.apache.flink.api.java.DataSet<Vertex<K,VertexDegrees.Degrees>>	runInternal(Graph<K,VV,EV> input) The implementation of the algorithm, renamed from GraphAlgorithm.run(Graph).
VertexDegrees<K,VV,EV>	setIncludeZeroDegreeVertices(boolean includeZeroDegreeVertices) By default only the edge set is processed for the computation of degree.
VertexDegrees<K,VV,EV>	setParallelism(int parallelism) Override the operator parallelism.

Methods inherited from class org.apache.flink.graph.utils.proxy.GraphAlgorithmDelegatingDataSet

equals, hashCode, run

Methods inherited from class java.lang.Object

clone, finalize, getClass, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

VertexDegrees

public VertexDegrees()

Method Detail

setIncludeZeroDegreeVertices

public VertexDegrees<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 an in-degree of zero.

Parameters:

includeZeroDegreeVertices - whether to output vertices with an in-degree of zero

Returns:

this

setParallelism

public VertexDegrees<K,VV,EV> setParallelism(int parallelism)

Override the operator parallelism.

Parameters:

parallelism - operator parallelism

Returns:

this

getAlgorithmName

protected String getAlgorithmName()

Description copied from class: GraphAlgorithmDelegatingDataSet

Algorithms are identified by name rather than by class to allow subclassing.

Specified by:

getAlgorithmName in class GraphAlgorithmDelegatingDataSet<K,VV,EV,Vertex<K,VertexDegrees.Degrees>>

Returns:

name of the algorithm, which may be shared by multiple classes implementing the same algorithm and generating the same output

mergeConfiguration

protected boolean mergeConfiguration(GraphAlgorithmDelegatingDataSet other)

Description copied from class: GraphAlgorithmDelegatingDataSet

An algorithm must first test whether the configurations can be merged before merging individual fields.

Specified by:

mergeConfiguration in class GraphAlgorithmDelegatingDataSet<K,VV,EV,Vertex<K,VertexDegrees.Degrees>>

Parameters:

other - the algorithm with which to compare and merge

Returns:

true if and only if configuration has been merged and the algorithm's output can be reused

runInternal

public org.apache.flink.api.java.DataSet<Vertex<K,VertexDegrees.Degrees>> runInternal(Graph<K,VV,EV> input)
                                                                               throws Exception

Description copied from class: GraphAlgorithmDelegatingDataSet

The implementation of the algorithm, renamed from GraphAlgorithm.run(Graph).

Specified by:

runInternal in class GraphAlgorithmDelegatingDataSet<K,VV,EV,Vertex<K,VertexDegrees.Degrees>>

Parameters:

input - the input graph

Returns:

the algorithm's output

Throws:

Exception