Class | Description |
---|---|
ConnectedComponents |
This example shows how to use Gelly's library methods.
|
EuclideanGraphWeighing |
This example shows how to use Gelly's
Graph.getTriplets() and
Graph.joinWithEdges(DataSet, EdgeJoinFunction) methods. |
EuclideanGraphWeighing.Point |
A simple two-dimensional point.
|
GraphMetrics |
This example illustrates how to use Gelly metrics methods and get simple statistics
from the input graph.
|
GSASingleSourceShortestPaths |
This example shows how to use Gelly's Gather-Sum-Apply iterations.
|
IncrementalSSSP |
This example illustrates how to
create a Graph directly from CSV files
use the scatter-gather iteration's messaging direction configuration option
Incremental Single Sink Shortest Paths Example.
|
IncrementalSSSP.InvalidateMessenger | |
IncrementalSSSP.VertexDistanceUpdater | |
JaccardSimilarityMeasure |
This example shows how to use
neighborhood methods
join with vertices
triplets
Given a directed, unweighted graph, return a weighted graph where the edge values are equal
to the Jaccard similarity coefficient - the number of common neighbors divided by the the size
of the union of neighbor sets - for the src and target vertices.
|
MusicProfiles |
This example demonstrates how to mix the DataSet Flink API with the Gelly API.
|
MusicProfiles.CreateSimilarUserEdges | |
MusicProfiles.ExtractMismatchSongIds | |
MusicProfiles.FilterOutMismatches | |
MusicProfiles.FilterSongNodes | |
MusicProfiles.GetTopSongPerUser | |
SingleSourceShortestPaths |
This example shows how to use Gelly's scatter-gather iterations.
|
SingleSourceShortestPaths.MinDistanceMessenger |
Distributes the minimum distance associated with a given vertex among all
the target vertices summed up with the edge's value.
|
SingleSourceShortestPaths.VertexDistanceUpdater |
Function that updates the value of a vertex by picking the minimum
distance from all incoming messages.
|
Copyright © 2014–2017 The Apache Software Foundation. All rights reserved.