org.apache.flink.graph.library.clustering.directed

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

java.lang.Object

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

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

org.apache.flink.graph.library.clustering.TriangleListingBase<K,VV,EV,TriangleListing.Result<K>>

org.apache.flink.graph.library.clustering.directed.TriangleListing<K,VV,EV>

Type Parameters:

K - graph ID type

VV - vertex value type

EV - edge value type

All Implemented Interfaces:

GraphAlgorithm<K,VV,EV,org.apache.flink.api.java.DataSet<TriangleListing.Result<K>>>

public class TriangleListing<K extends Comparable<K> & org.apache.flink.types.CopyableValue<K>,VV,EV>
extends TriangleListingBase<K,VV,EV,TriangleListing.Result<K>>

Generates a listing of distinct triangles from the input graph.

A triangle is a 3-clique with vertices A, B, and C connected by edges (A, B), (A, C), and (B, C).

The input graph must not contain duplicate edges or self-loops.

This algorithm is similar to the undirected version but also tracks and computes a bitmask representing the six potential graph edges connecting the triangle vertices.

Nested Class Summary

Nested Classes

Modifier and Type	Class and Description
static class	TriangleListing.Result<T> A result for the directed Triangle Listing algorithm.

Field Summary

Fields inherited from class org.apache.flink.graph.library.clustering.TriangleListingBase

permuteResults, sortTriangleVertices

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

parallelism

Constructor Summary

Constructors

Constructor and Description
TriangleListing()

Method Summary

Modifier and Type	Method and Description
org.apache.flink.api.java.DataSet<TriangleListing.Result<K>>	runInternal(Graph<K,VV,EV> input) The implementation of the algorithm, renamed from GraphAlgorithm.run(Graph).

Methods inherited from class org.apache.flink.graph.library.clustering.TriangleListingBase

canMergeConfigurationWith, mergeConfiguration, setPermuteResults, setSortTriangleVertices

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

getAlgorithmName, setParallelism

Methods inherited from class java.lang.Object

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

Constructor Detail

TriangleListing

public TriangleListing()

Method Detail

runInternal

public org.apache.flink.api.java.DataSet<TriangleListing.Result<K>> 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 extends Comparable<K> & org.apache.flink.types.CopyableValue<K>,VV,EV,TriangleListing.Result<K extends Comparable<K> & org.apache.flink.types.CopyableValue<K>>>

Parameters:

input - the input graph

Returns:

the algorithm's output

Throws:

Exception