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

Class EdgeSourceDegree<K,VV,EV>

java.lang.Object

org.apache.flink.graph.utils.proxy.GraphAlgorithmWrappingBase<K,VV,EV,DataSet<T>>

org.apache.flink.graph.utils.proxy.GraphAlgorithmWrappingDataSet<K,VV,EV,Edge<K,Tuple2<EV,LongValue>>>

org.apache.flink.graph.asm.degree.annotate.undirected.EdgeSourceDegree<K,VV,EV>

Type Parameters:

K - ID type

VV - vertex value type

EV - edge value type

All Implemented Interfaces:

GraphAlgorithm<K,VV,EV,DataSet<Edge<K,Tuple2<EV,LongValue>>>>

public class EdgeSourceDegree<K,VV,EV>
extends GraphAlgorithmWrappingDataSet<K,VV,EV,Edge<K,Tuple2<EV,LongValue>>>

Annotates edges of an undirected graph with degree of the source vertex.

Field Summary

Fields inherited from class org.apache.flink.graph.utils.proxy.GraphAlgorithmWrappingBase

parallelism

Constructor Summary

Constructors

Constructor and Description
EdgeSourceDegree()

Method Summary

Modifier and Type	Method and Description
protected void	mergeConfiguration(GraphAlgorithmWrappingBase other) Merge the other configuration into this algorithm's after the call to GraphAlgorithmWrappingBase.canMergeConfigurationWith(org.apache.flink.graph.utils.proxy.GraphAlgorithmWrappingBase) has checked that the configurations can be merged.
DataSet<Edge<K,Tuple2<EV,LongValue>>>	runInternal(Graph<K,VV,EV> input) The implementation of the algorithm, renamed from GraphAlgorithm.run(Graph).
EdgeSourceDegree<K,VV,EV>	setReduceOnTargetId(boolean reduceOnTargetId) The degree can be counted from either the edge source or target IDs.

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

equals, hashCode, run

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

canMergeConfigurationWith, getAlgorithmName, setParallelism

Methods inherited from class java.lang.Object

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

Constructor Detail

EdgeSourceDegree

public EdgeSourceDegree()

Method Detail

setReduceOnTargetId

public EdgeSourceDegree<K,VV,EV> setReduceOnTargetId(boolean reduceOnTargetId)

The degree can be counted from either the edge source or target IDs. By default the source IDs are counted. Reducing on target IDs may optimize the algorithm if the input edge list is sorted by target ID.

Parameters:

reduceOnTargetId - set to true if the input edge list is sorted by target ID

Returns:

this

mergeConfiguration

protected void mergeConfiguration(GraphAlgorithmWrappingBase other)

Description copied from class: GraphAlgorithmWrappingBase

Merge the other configuration into this algorithm's after the call to GraphAlgorithmWrappingBase.canMergeConfigurationWith(org.apache.flink.graph.utils.proxy.GraphAlgorithmWrappingBase) has checked that the configurations can be merged.

Overrides:

mergeConfiguration in class GraphAlgorithmWrappingBase<K,VV,EV,DataSet<Edge<K,Tuple2<EV,LongValue>>>>

Parameters:

other - the algorithm from which to merge configuration

See Also:

GraphAlgorithmWrappingBase.canMergeConfigurationWith(GraphAlgorithmWrappingBase)

runInternal

public DataSet<Edge<K,Tuple2<EV,LongValue>>> runInternal(Graph<K,VV,EV> input)
                                                  throws Exception

Description copied from class: GraphAlgorithmWrappingDataSet

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

Specified by:

runInternal in class GraphAlgorithmWrappingDataSet<K,VV,EV,Edge<K,Tuple2<EV,LongValue>>>

Parameters:

input - the input graph

Returns:

the algorithm's output

Throws:

Exception