K- graph ID type
VV- vertex value type
EV- edge value type
public class TriangleListing<K extends Comparable<K> & CopyableValue<K>,VV,EV> extends TriangleListingBase<K,VV,EV,TriangleListing.Result<K>>
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.
|Modifier and Type||Class and Description|
A result for the directed Triangle Listing algorithm.
|Constructor and Description|
|Modifier and Type||Method and Description|
The implementation of the algorithm, renamed from
canMergeConfigurationWith, mergeConfiguration, setPermuteResults, setSortTriangleVertices
equals, hashCode, run
public DataSet<TriangleListing.Result<K>> runInternal(Graph<K,VV,EV> input) throws Exception
GraphAlgorithmWrappingDataSet<K extends Comparable<K> & CopyableValue<K>,VV,EV,TriangleListing.Result<K extends Comparable<K> & CopyableValue<K>>>
input- the input graph
Copyright © 2014–2023 The Apache Software Foundation. All rights reserved.