Class and Description 

Edge
An Edge represents a link between two
vertices ,
the source and the target and can carry an attached value. 
EdgeDirection
The EdgeDirection is used to select a node's neighborhood
by the
Graph.groupReduceOnEdges(EdgesFunction, EdgeDirection) ,
Graph.groupReduceOnEdges(EdgesFunctionWithVertexValue, EdgeDirection) ,
Graph.groupReduceOnNeighbors(NeighborsFunction, EdgeDirection) ,
Graph.groupReduceOnNeighbors(NeighborsFunctionWithVertexValue, EdgeDirection) ,
Graph.reduceOnEdges(ReduceEdgesFunction, EdgeDirection) and
Graph.reduceOnNeighbors(ReduceNeighborsFunction, EdgeDirection)
methods. 
EdgeJoinFunction
Interface to be implemented by the transformation function
applied in
Graph.joinWithEdges(DataSet, EdgeJoinFunction) ,
Graph.joinWithEdgesOnSource(DataSet, EdgeJoinFunction) , and
Graph.joinWithEdgesOnTarget(DataSet, EdgeJoinFunction) methods. 
EdgeOrder
These bitmasks are used by edgeflipping algorithms to mark the edge order
relative to the original edge direction.

EdgesFunction
Interface to be implemented by the function applied to a vertex neighborhood
in the
Graph.groupReduceOnEdges(EdgesFunction, EdgeDirection) method. 
EdgesFunctionWithVertexValue
Interface to be implemented by the function applied to a vertex neighborhood
in the
Graph.groupReduceOnEdges(EdgesFunctionWithVertexValue, EdgeDirection)
method. 
Graph 
GraphAlgorithm 
GraphAnalytic
A
GraphAnalytic is similar to a GraphAlgorithm but is terminal
and results are retrieved via accumulators. 
GraphCsvReader
A class to build a Graph using path(s) provided to CSV file(s) with optional vertex and edge data.

NeighborsFunction
Interface to be implemented by the function applied to a vertex neighborhood
in the
Graph.groupReduceOnNeighbors(NeighborsFunction, EdgeDirection)
method. 
NeighborsFunctionWithVertexValue
Interface to be implemented by the function applied to a vertex neighborhood
in the
Graph.groupReduceOnNeighbors(NeighborsFunctionWithVertexValue, EdgeDirection)
method. 
ReduceEdgesFunction
Interface to be implemented by the function applied to a vertex neighborhood
in the
Graph.reduceOnEdges(org.apache.flink.graph.ReduceEdgesFunction, EdgeDirection) method. 
ReduceNeighborsFunction
Interface to be implemented by the function applied to a vertex neighborhood
in the
Graph.reduceOnNeighbors(ReduceNeighborsFunction, EdgeDirection)
method. 
Triplet
A Triplet stores and retrieves the edges along with their corresponding source and target vertices.

Vertex
Represents the graph's nodes.

VertexJoinFunction
Interface to be implemented by the transformation function
applied in
Graph.joinWithVertices(DataSet, VertexJoinFunction) method. 
Class and Description 

Edge
An Edge represents a link between two
vertices ,
the source and the target and can carry an attached value. 
Vertex
Represents the graph's nodes.

Class and Description 

Edge
An Edge represents a link between two
vertices ,
the source and the target and can carry an attached value. 
Graph 
GraphAlgorithm 
Vertex
Represents the graph's nodes.

Class and Description 

Edge
An Edge represents a link between two
vertices ,
the source and the target and can carry an attached value. 
Graph 
GraphAlgorithm 
Vertex
Represents the graph's nodes.

Class and Description 

Graph 
GraphAlgorithm 
Class and Description 

Graph 
GraphAlgorithm 
Class and Description 

Edge
An Edge represents a link between two
vertices ,
the source and the target and can carry an attached value. 
Graph 
GraphAlgorithm 
Vertex
Represents the graph's nodes.

Class and Description 

Graph 
Vertex
Represents the graph's nodes.

Class and Description 

Edge
An Edge represents a link between two
vertices ,
the source and the target and can carry an attached value. 
EdgesFunctionWithVertexValue
Interface to be implemented by the function applied to a vertex neighborhood
in the
Graph.groupReduceOnEdges(EdgesFunctionWithVertexValue, EdgeDirection)
method. 
Vertex
Represents the graph's nodes.

Class and Description 

Edge
An Edge represents a link between two
vertices ,
the source and the target and can carry an attached value. 
Vertex
Represents the graph's nodes.

Class and Description 

Edge
An Edge represents a link between two
vertices ,
the source and the target and can carry an attached value. 
Graph 
Vertex
Represents the graph's nodes.

Class and Description 

Edge
An Edge represents a link between two
vertices ,
the source and the target and can carry an attached value. 
EdgeDirection
The EdgeDirection is used to select a node's neighborhood
by the
Graph.groupReduceOnEdges(EdgesFunction, EdgeDirection) ,
Graph.groupReduceOnEdges(EdgesFunctionWithVertexValue, EdgeDirection) ,
Graph.groupReduceOnNeighbors(NeighborsFunction, EdgeDirection) ,
Graph.groupReduceOnNeighbors(NeighborsFunctionWithVertexValue, EdgeDirection) ,
Graph.reduceOnEdges(ReduceEdgesFunction, EdgeDirection) and
Graph.reduceOnNeighbors(ReduceNeighborsFunction, EdgeDirection)
methods. 
IterationConfiguration
This is used as a base class for vertexcentric iteration or gathersumapply iteration configuration.

Vertex
Represents the graph's nodes.

Class and Description 

Graph 
GraphAlgorithm 
Vertex
Represents the graph's nodes.

Class and Description 

AbstractGraphAnalytic
Base class for
GraphAnalytic . 
Graph 
GraphAlgorithm 
GraphAnalytic
A
GraphAnalytic is similar to a GraphAlgorithm but is terminal
and results are retrieved via accumulators. 
Vertex
Represents the graph's nodes.

Class and Description 

Graph 
GraphAlgorithm 
Vertex
Represents the graph's nodes.

Class and Description 

AbstractGraphAnalytic
Base class for
GraphAnalytic . 
Graph 
GraphAnalytic
A
GraphAnalytic is similar to a GraphAlgorithm but is terminal
and results are retrieved via accumulators. 
Class and Description 

AbstractGraphAnalytic
Base class for
GraphAnalytic . 
Graph 
GraphAnalytic
A
GraphAnalytic is similar to a GraphAlgorithm but is terminal
and results are retrieved via accumulators. 
Class and Description 

Edge
An Edge represents a link between two
vertices ,
the source and the target and can carry an attached value. 
Graph 
GraphAlgorithm 
Class and Description 

Edge
An Edge represents a link between two
vertices ,
the source and the target and can carry an attached value. 
IterationConfiguration
This is used as a base class for vertexcentric iteration or gathersumapply iteration configuration.

Vertex
Represents the graph's nodes.

Class and Description 

Edge
An Edge represents a link between two
vertices ,
the source and the target and can carry an attached value. 
EdgesFunction
Interface to be implemented by the function applied to a vertex neighborhood
in the
Graph.groupReduceOnEdges(EdgesFunction, EdgeDirection) method. 
EdgesFunctionWithVertexValue
Interface to be implemented by the function applied to a vertex neighborhood
in the
Graph.groupReduceOnEdges(EdgesFunctionWithVertexValue, EdgeDirection)
method. 
NeighborsFunction
Interface to be implemented by the function applied to a vertex neighborhood
in the
Graph.groupReduceOnNeighbors(NeighborsFunction, EdgeDirection)
method. 
NeighborsFunctionWithVertexValue
Interface to be implemented by the function applied to a vertex neighborhood
in the
Graph.groupReduceOnNeighbors(NeighborsFunctionWithVertexValue, EdgeDirection)
method. 
Vertex
Represents the graph's nodes.

Class and Description 

Edge
An Edge represents a link between two
vertices ,
the source and the target and can carry an attached value. 
EdgeDirection
The EdgeDirection is used to select a node's neighborhood
by the
Graph.groupReduceOnEdges(EdgesFunction, EdgeDirection) ,
Graph.groupReduceOnEdges(EdgesFunctionWithVertexValue, EdgeDirection) ,
Graph.groupReduceOnNeighbors(NeighborsFunction, EdgeDirection) ,
Graph.groupReduceOnNeighbors(NeighborsFunctionWithVertexValue, EdgeDirection) ,
Graph.reduceOnEdges(ReduceEdgesFunction, EdgeDirection) and
Graph.reduceOnNeighbors(ReduceNeighborsFunction, EdgeDirection)
methods. 
IterationConfiguration
This is used as a base class for vertexcentric iteration or gathersumapply iteration configuration.

Vertex
Represents the graph's nodes.

Class and Description 

Edge
An Edge represents a link between two
vertices ,
the source and the target and can carry an attached value. 
Vertex
Represents the graph's nodes.

Class and Description 

Graph 
GraphAlgorithm 
Class and Description 

Graph 
Copyright © 2014–2017 The Apache Software Foundation. All rights reserved.