Package | Description |
---|---|
org.apache.flink.graph | |
org.apache.flink.graph.asm.degree.annotate |
The degree annotation package provides a collection of edge-centric graph algorithms for counting
the vertex degree of directed and undirected graphs.
|
org.apache.flink.graph.asm.degree.annotate.directed | |
org.apache.flink.graph.asm.degree.annotate.undirected | |
org.apache.flink.graph.asm.translate | |
org.apache.flink.graph.examples | |
org.apache.flink.graph.examples.data | |
org.apache.flink.graph.generator | |
org.apache.flink.graph.gsa | |
org.apache.flink.graph.pregel | |
org.apache.flink.graph.spargel | |
org.apache.flink.graph.utils |
Modifier and Type | Method and Description |
---|---|
Edge<K,EV> |
Triplet.getEdge() |
Edge<K,V> |
Edge.reverse()
Reverses the direction of this Edge.
|
Modifier and Type | Method and Description |
---|---|
DataSet<Edge<K,EV>> |
Graph.getEdges() |
Modifier and Type | Method and Description |
---|---|
Graph<K,VV,EV> |
Graph.removeEdge(Edge<K,EV> edge)
Removes all edges that match the given edge from the graph.
|
Modifier and Type | Method and Description |
---|---|
Graph<K,VV,EV> |
Graph.addEdges(List<Edge<K,EV>> newEdges)
Adds the given list edges to the graph.
|
Graph<K,VV,EV> |
Graph.filterOnEdges(FilterFunction<Edge<K,EV>> edgeFilter)
Apply a filtering function to the graph and return a sub-graph that satisfies the predicates
only for the edges.
|
static <K,EV> Graph<K,NullValue,EV> |
Graph.fromCollection(Collection<Edge<K,EV>> edges,
ExecutionEnvironment context)
Creates a graph from a Collection of edges.
|
static <K,VV,EV> Graph<K,VV,EV> |
Graph.fromCollection(Collection<Edge<K,EV>> edges,
MapFunction<K,VV> vertexValueInitializer,
ExecutionEnvironment context)
Creates a graph from a Collection of edges.
|
static <K,VV,EV> Graph<K,VV,EV> |
Graph.fromCollection(Collection<Vertex<K,VV>> vertices,
Collection<Edge<K,EV>> edges,
ExecutionEnvironment context)
Creates a graph from a Collection of vertices and a Collection of edges.
|
static <K,EV> Graph<K,NullValue,EV> |
Graph.fromDataSet(DataSet<Edge<K,EV>> edges,
ExecutionEnvironment context)
Creates a graph from a DataSet of edges.
|
static <K,VV,EV> Graph<K,VV,EV> |
Graph.fromDataSet(DataSet<Edge<K,EV>> edges,
MapFunction<K,VV> vertexValueInitializer,
ExecutionEnvironment context)
Creates a graph from a DataSet of edges.
|
static <K,VV,EV> Graph<K,VV,EV> |
Graph.fromDataSet(DataSet<Vertex<K,VV>> vertices,
DataSet<Edge<K,EV>> edges,
ExecutionEnvironment context)
Creates a graph from a DataSet of vertices and a DataSet of edges.
|
void |
EdgesFunction.iterateEdges(Iterable<Tuple2<K,Edge<K,EV>>> edges,
Collector<O> out)
This method is called per vertex and can iterate over all of its neighboring edges with the
specified direction.
|
void |
EdgesFunctionWithVertexValue.iterateEdges(Vertex<K,VV> vertex,
Iterable<Edge<K,EV>> edges,
Collector<O> out)
This method is called per vertex and can iterate over all of its neighboring edges with the
specified direction.
|
void |
NeighborsFunction.iterateNeighbors(Iterable<Tuple3<K,Edge<K,EV>,Vertex<K,VV>>> neighbors,
Collector<O> out)
This method is called per vertex and can iterate over all of its neighbors with the specified
direction.
|
void |
NeighborsFunctionWithVertexValue.iterateNeighbors(Vertex<K,VV> vertex,
Iterable<Tuple2<Edge<K,EV>,Vertex<K,VV>>> neighbors,
Collector<O> out)
This method is called per vertex and can iterate over all of its neighbors with the specified
direction.
|
<NV> Graph<K,VV,NV> |
Graph.mapEdges(MapFunction<Edge<K,EV>,NV> mapper)
Apply a function to the attribute of each edge in the graph.
|
<NV> Graph<K,VV,NV> |
Graph.mapEdges(MapFunction<Edge<K,EV>,NV> mapper,
TypeInformation<Edge<K,NV>> returnType)
Apply a function to the attribute of each edge in the graph.
|
<NV> Graph<K,VV,NV> |
Graph.mapEdges(MapFunction<Edge<K,EV>,NV> mapper,
TypeInformation<Edge<K,NV>> returnType)
Apply a function to the attribute of each edge in the graph.
|
Graph<K,VV,EV> |
Graph.removeEdges(List<Edge<K,EV>> edgesToBeRemoved)
Removes all the edges that match the edges in the given data set from the graph.
|
Graph<K,VV,EV> |
Graph.subgraph(FilterFunction<Vertex<K,VV>> vertexFilter,
FilterFunction<Edge<K,EV>> edgeFilter)
Apply filtering functions to the graph and return a sub-graph that satisfies the predicates
for both vertices and edges.
|
Constructor and Description |
---|
Triplet(Vertex<K,VV> srcVertex,
Vertex<K,VV> trgVertex,
Edge<K,EV> edge)
Constructs a Triplet from a given source vertex, target vertex, and edge.
|
Constructor and Description |
---|
Graph(DataSet<Vertex<K,VV>> vertices,
DataSet<Edge<K,EV>> edges,
ExecutionEnvironment context)
Creates a graph from two DataSets: vertices and edges.
|
Modifier and Type | Method and Description |
---|---|
Edge<K,Tuple2<EV,D>> |
DegreeAnnotationFunctions.JoinEdgeWithVertexDegree.join(Edge<K,EV> edge,
Vertex<K,D> vertex) |
Edge<K,Tuple3<EV,D,D>> |
DegreeAnnotationFunctions.JoinEdgeDegreeWithVertexDegree.join(Edge<K,Tuple2<EV,D>> edge,
Vertex<K,D> vertex) |
Modifier and Type | Method and Description |
---|---|
Edge<K,Tuple2<EV,D>> |
DegreeAnnotationFunctions.JoinEdgeWithVertexDegree.join(Edge<K,EV> edge,
Vertex<K,D> vertex) |
Edge<K,Tuple3<EV,D,D>> |
DegreeAnnotationFunctions.JoinEdgeDegreeWithVertexDegree.join(Edge<K,Tuple2<EV,D>> edge,
Vertex<K,D> vertex) |
Vertex<K,LongValue> |
DegreeAnnotationFunctions.MapEdgeToSourceId.map(Edge<K,EV> value) |
Vertex<K,LongValue> |
DegreeAnnotationFunctions.MapEdgeToTargetId.map(Edge<K,EV> value) |
Modifier and Type | Method and Description |
---|---|
DataSet<Edge<K,Tuple2<EV,VertexDegrees.Degrees>>> |
EdgeTargetDegrees.runInternal(Graph<K,VV,EV> input) |
DataSet<Edge<K,Tuple3<EV,VertexDegrees.Degrees,VertexDegrees.Degrees>>> |
EdgeDegreesPair.runInternal(Graph<K,VV,EV> input) |
DataSet<Edge<K,Tuple2<EV,VertexDegrees.Degrees>>> |
EdgeSourceDegrees.runInternal(Graph<K,VV,EV> input) |
Modifier and Type | Method and Description |
---|---|
DataSet<Edge<K,Tuple3<EV,LongValue,LongValue>>> |
EdgeDegreePair.runInternal(Graph<K,VV,EV> input) |
DataSet<Edge<K,Tuple2<EV,LongValue>>> |
EdgeTargetDegree.runInternal(Graph<K,VV,EV> input) |
DataSet<Edge<K,Tuple2<EV,LongValue>>> |
EdgeSourceDegree.runInternal(Graph<K,VV,EV> input) |
Modifier and Type | Method and Description |
---|---|
static <OLD,NEW,EV> |
Translate.translateEdgeIds(DataSet<Edge<OLD,EV>> edges,
TranslateFunction<OLD,NEW> translator)
Translate
Edge IDs using the given TranslateFunction . |
static <OLD,NEW,EV> |
Translate.translateEdgeIds(DataSet<Edge<OLD,EV>> edges,
TranslateFunction<OLD,NEW> translator,
int parallelism)
Translate
Edge IDs using the given TranslateFunction . |
static <K,OLD,NEW> |
Translate.translateEdgeValues(DataSet<Edge<K,OLD>> edges,
TranslateFunction<OLD,NEW> translator)
Translate
Edge values using the given TranslateFunction . |
static <K,OLD,NEW> |
Translate.translateEdgeValues(DataSet<Edge<K,OLD>> edges,
TranslateFunction<OLD,NEW> translator,
int parallelism)
Translate
Edge values using the given TranslateFunction . |
Modifier and Type | Method and Description |
---|---|
static <OLD,NEW,EV> |
Translate.translateEdgeIds(DataSet<Edge<OLD,EV>> edges,
TranslateFunction<OLD,NEW> translator)
Translate
Edge IDs using the given TranslateFunction . |
static <OLD,NEW,EV> |
Translate.translateEdgeIds(DataSet<Edge<OLD,EV>> edges,
TranslateFunction<OLD,NEW> translator,
int parallelism)
Translate
Edge IDs using the given TranslateFunction . |
static <K,OLD,NEW> |
Translate.translateEdgeValues(DataSet<Edge<K,OLD>> edges,
TranslateFunction<OLD,NEW> translator)
Translate
Edge values using the given TranslateFunction . |
static <K,OLD,NEW> |
Translate.translateEdgeValues(DataSet<Edge<K,OLD>> edges,
TranslateFunction<OLD,NEW> translator,
int parallelism)
Translate
Edge values using the given TranslateFunction . |
Modifier and Type | Method and Description |
---|---|
static boolean |
IncrementalSSSP.isInSSSP(Edge<Long,Double> edgeToBeRemoved,
DataSet<Edge<Long,Double>> edgesInSSSP)
Function that verifies whether the edge to be removed is part of the SSSP or not.
|
Modifier and Type | Method and Description |
---|---|
static boolean |
IncrementalSSSP.isInSSSP(Edge<Long,Double> edgeToBeRemoved,
DataSet<Edge<Long,Double>> edgesInSSSP)
Function that verifies whether the edge to be removed is part of the SSSP or not.
|
Constructor and Description |
---|
InvalidateMessenger(Edge<Long,Double> edgeToBeRemoved) |
Modifier and Type | Method and Description |
---|---|
static Edge<Long,Double> |
IncrementalSSSPData.getDefaultEdgeToBeRemoved() |
Modifier and Type | Method and Description |
---|---|
static <K,EV> DataSet<Vertex<K,NullValue>> |
GraphGeneratorUtils.vertexSet(DataSet<Edge<K,EV>> edges,
int parallelism)
|
Modifier and Type | Method and Description |
---|---|
static <K,VV,EV,M> |
GatherSumApplyIteration.withEdges(DataSet<Edge<K,EV>> edges,
GatherFunction<VV,EV,M> gather,
SumFunction<VV,EV,M> sum,
ApplyFunction<K,VV,M> apply,
int maximumNumberOfIterations)
Creates a new gather-sum-apply iteration operator for graphs.
|
Modifier and Type | Method and Description |
---|---|
Iterable<Edge<K,EV>> |
ComputeFunction.getEdges()
Gets an
Iterable with all out-going edges. |
Modifier and Type | Method and Description |
---|---|
static <K,VV,EV,Message> |
VertexCentricIteration.withEdges(DataSet<Edge<K,EV>> edgesWithValue,
ComputeFunction<K,VV,EV,Message> cf,
int maximumNumberOfIterations)
Creates a new vertex-centric iteration operator.
|
static <K,VV,EV,Message> |
VertexCentricIteration.withEdges(DataSet<Edge<K,EV>> edgesWithValue,
ComputeFunction<K,VV,EV,Message> cf,
MessageCombiner<K,Message> mc,
int maximumNumberOfIterations)
Creates a new vertex-centric iteration operator for graphs where the edges are associated
with a value (such as a weight or distance).
|
Modifier and Type | Method and Description |
---|---|
Iterable<Edge<K,EV>> |
ScatterFunction.getEdges()
Gets an
Iterable with all edges. |
Modifier and Type | Method and Description |
---|---|
static <K,VV,Message,EV> |
ScatterGatherIteration.withEdges(DataSet<Edge<K,EV>> edgesWithValue,
ScatterFunction<K,VV,Message,EV> sf,
GatherFunction<K,VV,Message> gf,
int maximumNumberOfIterations)
Creates a new scatter-gather iteration operator for graphs where the edges are associated
with a value (such as a weight or distance).
|
Modifier and Type | Method and Description |
---|---|
Edge<K,NullValue> |
Tuple2ToEdgeMap.map(Tuple2<K,K> tuple) |
Edge<K,EV> |
Tuple3ToEdgeMap.map(Tuple3<K,K,EV> tuple) |
Modifier and Type | Method and Description |
---|---|
Tuple3<K,K,EV> |
EdgeToTuple3Map.map(Edge<K,EV> edge) |
Tuple2<K,K> |
EdgeToTuple2Map.map(Edge<K,EV> edge) |
Copyright © 2014–2023 The Apache Software Foundation. All rights reserved.