org.apache.flink.graph.library

Class GSATriangleCount<K extends Comparable<K>,VV,EV>

java.lang.Object

org.apache.flink.graph.library.GSATriangleCount<K,VV,EV>

All Implemented Interfaces:

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

public class GSATriangleCount<K extends Comparable<K>,VV,EV>
extends Object
implements GraphAlgorithm<K,VV,EV,org.apache.flink.api.java.DataSet<Integer>>

Triangle Count Algorithm. This algorithm operates in three phases. First, vertices select neighbors with id greater than theirs and send messages to them. Each received message is then propagated to neighbors with higher id. Finally, if a node encounters the target id in the list of received messages, it increments the number of triangles found. This implementation is non - iterative. The algorithm takes an undirected, unweighted graph as input and outputs a DataSet which contains a single integer representing the number of triangles.

Constructor Summary

Constructors

Constructor and Description
GSATriangleCount()

Method Summary

Modifier and Type	Method and Description
org.apache.flink.api.java.DataSet<Integer>	run(Graph<K,VV,EV> input)

Methods inherited from class java.lang.Object

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

Constructor Detail

GSATriangleCount

public GSATriangleCount()

Method Detail

run

public org.apache.flink.api.java.DataSet<Integer> run(Graph<K,VV,EV> input)
                                               throws Exception

Specified by:

run in interface GraphAlgorithm<K extends Comparable<K>,VV,EV,org.apache.flink.api.java.DataSet<Integer>>

Throws:

Exception