Class | Description |
---|---|
BipartitenessCheck<EV> |
The Bipartiteness check library method checks whether an input graph is bipartite
or not.
|
BipartitenessCheck.CombineFunction |
Implements the ReduceFunction Interface, applies reduce function to
combine group of elements into a single value.
|
BipartitenessCheck.UpdateFunction<EV> |
Implements the EdgesFold Interface, applies foldEdges function to
a vertex neighborhood.
|
ConnectedComponents<K,EV> |
The Connected Components library method assigns a component ID to each vertex in the graph.
|
ConnectedComponents.CombineCC<K> |
Implements the ReduceFunction Interface, applies reduce function to
combine group of elements into a single value.
|
ConnectedComponents.UpdateCC<K,EV> |
Implements EdgesFold Interface, applies foldEdges function to
a vertex neighborhood
The Edge stream is divided into different windows, the foldEdges function
is applied on each window incrementally and the aggregate state for each window
is updated, in this case it checks the connected components in a window.
|
ExactTriangleCount |
Single-pass, insertion-only exact Triangle Local and Global Count algorithm.
|
ExactTriangleCount.IntersectNeighborhoods |
Receives 2 tuples from the same edge (src + target) and intersects the attached neighborhoods.
|
ExactTriangleCount.ProjectCanonicalEdges | |
ExactTriangleCount.SumAndEmitCounters |
Sums up and emits local and global counters.
|
Spanner<K extends Comparable<K>,EV> |
The Spanner library method continuously computes a k-Spanner of an insertion-only edge stream.
|
Spanner.CombineSpanners<K extends Comparable<K>> |
Merge the local spanners of each partition into the global spanner.
|
Spanner.UpdateLocal<K extends Comparable<K>,EV> |
Decide to add or remove an edge to the local spanner in the current window.
|
Copyright © 2020. All rights reserved.