public class PathGraph extends GraphGeneratorBase<org.apache.flink.types.LongValue,org.apache.flink.types.NullValue,org.apache.flink.types.NullValue>
| Modifier and Type | Field and Description |
|---|---|
static int |
MINIMUM_VERTEX_COUNT |
parallelism| Constructor and Description |
|---|
PathGraph(org.apache.flink.api.java.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. |
| Modifier and Type | Method and Description |
|---|---|
Graph<org.apache.flink.types.LongValue,org.apache.flink.types.NullValue,org.apache.flink.types.NullValue> |
generate()
Generates the configured graph.
|
setParallelismpublic static final int MINIMUM_VERTEX_COUNT
public PathGraph(org.apache.flink.api.java.ExecutionEnvironment env,
long vertexCount)
Graph with n vertices where each vertex
vi connects to adjacent vertices vi+1 when
i < n-1 and vi-1 when i > 0.
A PathGraph is distinguished from a CycleGraph in that
the first and last vertex are not connected, breaking the cycle.
env - the Flink execution environmentvertexCount - number of verticespublic Graph<org.apache.flink.types.LongValue,org.apache.flink.types.NullValue,org.apache.flink.types.NullValue> generate()
GraphGeneratorCopyright © 2014–2019 The Apache Software Foundation. All rights reserved.