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
|
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.
|
void |
MusicProfiles.GetTopSongPerUser.iterateEdges(Vertex<String,NullValue> vertex,
Iterable<Edge<String,Integer>> edges,
Collector<Tuple2<String,String>> out) |
void |
MusicProfiles.CreateSimilarUserEdges.reduce(Iterable<Edge<String,Integer>> edges,
Collector<Edge<String,NullValue>> out) |
void |
MusicProfiles.CreateSimilarUserEdges.reduce(Iterable<Edge<String,Integer>> edges,
Collector<Edge<String,NullValue>> out) |
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 DataSet<Edge<Long,Double>> |
ExampleUtils.getLongDoubleEdgeData(ExecutionEnvironment env) |
static DataSet<Edge<Long,NullValue>> |
ExampleUtils.getRandomEdges(ExecutionEnvironment env,
long numVertices) |
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 |
---|---|
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(scala.collection.immutable.List<Edge<K,EV>> edges)
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.
|
Graph<K,VV,EV> |
Graph.filterOnEdges(scala.Function1<Edge<K,EV>,Object> edgeFilterFun)
Apply a filtering function to the graph and return a sub-graph that
satisfies the predicates only for the edges.
|
<K,EV> Graph<K,NullValue,EV> |
Graph$.fromCollection(scala.collection.Seq<Edge<K,EV>> edges,
ExecutionEnvironment env,
TypeInformation<K> evidence$23,
scala.reflect.ClassTag<K> evidence$24,
TypeInformation<EV> evidence$25,
scala.reflect.ClassTag<EV> evidence$26)
Creates a Graph from a Seq of edges.
|
static <K,EV> Graph<K,NullValue,EV> |
Graph.fromCollection(scala.collection.Seq<Edge<K,EV>> edges,
ExecutionEnvironment env,
TypeInformation<K> evidence$23,
scala.reflect.ClassTag<K> evidence$24,
TypeInformation<EV> evidence$25,
scala.reflect.ClassTag<EV> evidence$26)
Creates a Graph from a Seq of edges.
|
<K,VV,EV> Graph<K,VV,EV> |
Graph$.fromCollection(scala.collection.Seq<Edge<K,EV>> edges,
MapFunction<K,VV> vertexValueInitializer,
ExecutionEnvironment env,
TypeInformation<K> evidence$27,
scala.reflect.ClassTag<K> evidence$28,
TypeInformation<VV> evidence$29,
scala.reflect.ClassTag<VV> evidence$30,
TypeInformation<EV> evidence$31,
scala.reflect.ClassTag<EV> evidence$32)
Creates a graph from a Seq of edges.
|
static <K,VV,EV> Graph<K,VV,EV> |
Graph.fromCollection(scala.collection.Seq<Edge<K,EV>> edges,
MapFunction<K,VV> vertexValueInitializer,
ExecutionEnvironment env,
TypeInformation<K> evidence$27,
scala.reflect.ClassTag<K> evidence$28,
TypeInformation<VV> evidence$29,
scala.reflect.ClassTag<VV> evidence$30,
TypeInformation<EV> evidence$31,
scala.reflect.ClassTag<EV> evidence$32)
Creates a graph from a Seq of edges.
|
<K,VV,EV> Graph<K,VV,EV> |
Graph$.fromCollection(scala.collection.Seq<Vertex<K,VV>> vertices,
scala.collection.Seq<Edge<K,EV>> edges,
ExecutionEnvironment env,
TypeInformation<K> evidence$17,
scala.reflect.ClassTag<K> evidence$18,
TypeInformation<VV> evidence$19,
scala.reflect.ClassTag<VV> evidence$20,
TypeInformation<EV> evidence$21,
scala.reflect.ClassTag<EV> evidence$22)
Creates a Graph from a Seq of vertices and a Seq of edges.
|
static <K,VV,EV> Graph<K,VV,EV> |
Graph.fromCollection(scala.collection.Seq<Vertex<K,VV>> vertices,
scala.collection.Seq<Edge<K,EV>> edges,
ExecutionEnvironment env,
TypeInformation<K> evidence$17,
scala.reflect.ClassTag<K> evidence$18,
TypeInformation<VV> evidence$19,
scala.reflect.ClassTag<VV> evidence$20,
TypeInformation<EV> evidence$21,
scala.reflect.ClassTag<EV> evidence$22)
Creates a Graph from a Seq of vertices and a Seq of edges.
|
<K,EV> Graph<K,NullValue,EV> |
Graph$.fromDataSet(DataSet<Edge<K,EV>> edges,
ExecutionEnvironment env,
TypeInformation<K> evidence$7,
scala.reflect.ClassTag<K> evidence$8,
TypeInformation<EV> evidence$9,
scala.reflect.ClassTag<EV> evidence$10)
Creates a Graph from a DataSet of edges.
|
static <K,EV> Graph<K,NullValue,EV> |
Graph.fromDataSet(DataSet<Edge<K,EV>> edges,
ExecutionEnvironment env,
TypeInformation<K> evidence$7,
scala.reflect.ClassTag<K> evidence$8,
TypeInformation<EV> evidence$9,
scala.reflect.ClassTag<EV> evidence$10)
Creates a Graph from a DataSet of edges.
|
<K,VV,EV> Graph<K,VV,EV> |
Graph$.fromDataSet(DataSet<Edge<K,EV>> edges,
MapFunction<K,VV> vertexValueInitializer,
ExecutionEnvironment env,
TypeInformation<K> evidence$11,
scala.reflect.ClassTag<K> evidence$12,
TypeInformation<VV> evidence$13,
scala.reflect.ClassTag<VV> evidence$14,
TypeInformation<EV> evidence$15,
scala.reflect.ClassTag<EV> evidence$16)
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 env,
TypeInformation<K> evidence$11,
scala.reflect.ClassTag<K> evidence$12,
TypeInformation<VV> evidence$13,
scala.reflect.ClassTag<VV> evidence$14,
TypeInformation<EV> evidence$15,
scala.reflect.ClassTag<EV> evidence$16)
Creates a graph from a DataSet of edges.
|
<K,VV,EV> Graph<K,VV,EV> |
Graph$.fromDataSet(DataSet<Vertex<K,VV>> vertices,
DataSet<Edge<K,EV>> edges,
ExecutionEnvironment env,
TypeInformation<K> evidence$1,
scala.reflect.ClassTag<K> evidence$2,
TypeInformation<VV> evidence$3,
scala.reflect.ClassTag<VV> evidence$4,
TypeInformation<EV> evidence$5,
scala.reflect.ClassTag<EV> evidence$6)
Creates a Graph from a DataSet of vertices and 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 env,
TypeInformation<K> evidence$1,
scala.reflect.ClassTag<K> evidence$2,
TypeInformation<VV> evidence$3,
scala.reflect.ClassTag<VV> evidence$4,
TypeInformation<EV> evidence$5,
scala.reflect.ClassTag<EV> evidence$6)
Creates a Graph from a DataSet of vertices and a DataSet of edges.
|
abstract void |
EdgesFunction.iterateEdges(scala.collection.Iterable<scala.Tuple2<K,Edge<K,EV>>> edges,
Collector<T> out) |
void |
EdgesFunction.iterateEdges(Iterable<Tuple2<K,Edge<K,EV>>> edges,
Collector<T> out) |
abstract void |
EdgesFunctionWithVertexValue.iterateEdges(Vertex<K,VV> v,
scala.collection.Iterable<Edge<K,EV>> edges,
Collector<T> out) |
void |
EdgesFunctionWithVertexValue.iterateEdges(Vertex<K,VV> v,
Iterable<Edge<K,EV>> edges,
Collector<T> out) |
abstract void |
NeighborsFunction.iterateNeighbors(scala.collection.Iterable<scala.Tuple3<K,Edge<K,EV>,Vertex<K,VV>>> neighbors,
Collector<T> out) |
void |
NeighborsFunction.iterateNeighbors(Iterable<Tuple3<K,Edge<K,EV>,Vertex<K,VV>>> neighbors,
Collector<T> out) |
abstract void |
NeighborsFunctionWithVertexValue.iterateNeighbors(Vertex<K,VV> vertex,
scala.collection.Iterable<scala.Tuple2<Edge<K,EV>,Vertex<K,VV>>> neighbors,
Collector<T> out) |
void |
NeighborsFunctionWithVertexValue.iterateNeighbors(Vertex<K,VV> vertex,
Iterable<Tuple2<Edge<K,EV>,Vertex<K,VV>>> neighbors,
Collector<T> out) |
<NV> Graph<K,VV,NV> |
Graph.mapEdges(scala.Function1<Edge<K,EV>,NV> fun,
TypeInformation<NV> evidence$73,
scala.reflect.ClassTag<NV> evidence$74)
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<NV> evidence$71,
scala.reflect.ClassTag<NV> evidence$72)
Apply a function to the attribute of each edge in the graph.
|
Graph<K,VV,EV> |
Graph.removeEdges(scala.collection.immutable.List<Edge<K,EV>> edges)
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.
|
Graph<K,VV,EV> |
Graph.subgraph(scala.Function1<Vertex<K,VV>,Object> vertexFilterFun,
scala.Function1<Edge<K,EV>,Object> edgeFilterFun)
Apply filtering functions to the graph and return a sub-graph that
satisfies the predicates for both vertices and edges.
|
Modifier and Type | Method and Description |
---|---|
Edge<K,EV> |
Tuple3ToEdgeMap.map(scala.Tuple3<K,K,EV> value) |
Modifier and Type | Method and Description |
---|---|
scala.Tuple3<K,K,EV> |
EdgeToTuple3Map.map(Edge<K,EV> value) |
Modifier and Type | Method and Description |
---|---|
Iterable<Edge<K,EV>> |
MessagingFunction.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,
VertexUpdateFunction<K,VV,Message> uf,
MessagingFunction<K,VV,Message,EV> mf,
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,EV> |
Tuple3ToEdgeMap.map(Tuple3<K,K,EV> tuple) |
Modifier and Type | Method and Description |
---|---|
NullValue |
NullValueEdgeMapper.map(Edge<K,EV> edge) |
Tuple3<K,K,EV> |
EdgeToTuple3Map.map(Edge<K,EV> edge) |
Copyright © 2014–2017 The Apache Software Foundation. All rights reserved.