org.apache.flink.graph.asm.simple.undirected

Class Simplify<K extends Comparable<K> & org.apache.flink.types.CopyableValue<K>,VV,EV>

java.lang.Object

org.apache.flink.graph.utils.proxy.GraphAlgorithmDelegatingGraph<K,VV,EV,K,VV,EV>

org.apache.flink.graph.asm.simple.undirected.Simplify<K,VV,EV>

Type Parameters:

K - ID type

VV - vertex value type

EV - edge value type

All Implemented Interfaces:

GraphAlgorithm<K,VV,EV,Graph<K,VV,EV>>

public class Simplify<K extends Comparable<K> & org.apache.flink.types.CopyableValue<K>,VV,EV>
extends GraphAlgorithmDelegatingGraph<K,VV,EV,K,VV,EV>

Add symmetric edges and remove self-loops and duplicate edges from an undirected graph.

Constructor Summary

Constructors

Constructor and Description
Simplify(boolean clipAndFlip) Simplifies an undirected graph by adding reverse edges and removing self-loops and duplicate edges.

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(GraphAlgorithmDelegatingGraph other) An algorithm must first test whether the configurations can be merged before merging individual fields.
Graph<K,VV,EV>	runInternal(Graph<K,VV,EV> input) The implementation of the algorithm, renamed from GraphAlgorithm.run(Graph).
Simplify<K,VV,EV>	setParallelism(int parallelism) Override the operator parallelism.

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

equals, hashCode, run

Methods inherited from class java.lang.Object

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

Constructor Detail

Simplify

public Simplify(boolean clipAndFlip)

Simplifies an undirected graph by adding reverse edges and removing self-loops and duplicate edges. When clip-and-flip is set, edges where source < target are removed before symmetrizing the graph.

Parameters:

clipAndFlip - method for generating simple graph

Method Detail

setParallelism

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

Override the operator parallelism.

Parameters:

parallelism - operator parallelism

Returns:

this

getAlgorithmName

protected String getAlgorithmName()

Description copied from class: GraphAlgorithmDelegatingGraph

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

Specified by:

getAlgorithmName in class GraphAlgorithmDelegatingGraph<K extends Comparable<K> & org.apache.flink.types.CopyableValue<K>,VV,EV,K extends Comparable<K> & org.apache.flink.types.CopyableValue<K>,VV,EV>

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(GraphAlgorithmDelegatingGraph other)

Description copied from class: GraphAlgorithmDelegatingGraph

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

Specified by:

mergeConfiguration in class GraphAlgorithmDelegatingGraph<K extends Comparable<K> & org.apache.flink.types.CopyableValue<K>,VV,EV,K extends Comparable<K> & org.apache.flink.types.CopyableValue<K>,VV,EV>

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 Graph<K,VV,EV> runInternal(Graph<K,VV,EV> input)
                           throws Exception

Description copied from class: GraphAlgorithmDelegatingGraph

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

Specified by:

runInternal in class GraphAlgorithmDelegatingGraph<K extends Comparable<K> & org.apache.flink.types.CopyableValue<K>,VV,EV,K extends Comparable<K> & org.apache.flink.types.CopyableValue<K>,VV,EV>

Parameters:

input - the input graph

Returns:

the algorithm's output

Throws:

Exception