org.apache.flink.graph.generator

Class PathGraph

java.lang.Object

org.apache.flink.graph.generator.GraphGeneratorBase<LongValue,NullValue,NullValue>

org.apache.flink.graph.generator.PathGraph

All Implemented Interfaces:

GraphGenerator<LongValue,NullValue,NullValue>

public class PathGraph
extends GraphGeneratorBase<LongValue,NullValue,NullValue>

See Also:

Path Graph at Wolfram MathWorld

Field Summary

Fields

Modifier and Type	Field and Description
static int	MINIMUM_VERTEX_COUNT

Fields inherited from class org.apache.flink.graph.generator.GraphGeneratorBase

parallelism

Constructor Summary

Constructors

Constructor and Description
PathGraph(ExecutionEnvironment env, long vertexCount) An undirected Graph with n vertices where each vertex vi connects to adjacent vertices vi+1 when i < n-1 and vi-1 when i > 0.

Method Summary

Modifier and Type	Method and Description
Graph<LongValue,NullValue,NullValue>	generate() Generates the configured graph.

Methods inherited from class org.apache.flink.graph.generator.GraphGeneratorBase

setParallelism

Methods inherited from class java.lang.Object

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

Field Detail

MINIMUM_VERTEX_COUNT

public static final int MINIMUM_VERTEX_COUNT

See Also:

Constant Field Values

Constructor Detail

PathGraph

public PathGraph(ExecutionEnvironment env,
                 long vertexCount)

An undirected Graph with n vertices where each vertex v_i connects to adjacent vertices v_i+1 when i < n-1 and v_i-1 when i > 0.

A PathGraph is distinguished from a CycleGraph in that the first and last vertex are not connected, breaking the cycle.

Parameters:

env - the Flink execution environment

vertexCount - number of vertices

Method Detail

generate

public Graph<LongValue,NullValue,NullValue> generate()

Description copied from interface: GraphGenerator

Generates the configured graph.

Returns:

generated graph