Modifier and Type | Class and Description |
---|---|
class |
EdgeDegreesPair<K,VV,EV>
Annotates edges of a directed graph with the degree, out-degree, and in-degree of both the source
and target vertices.
|
class |
EdgeSourceDegrees<K,VV,EV>
Annotates edges of a directed graph with the degree, out-degree, and in-degree of the source
vertex.
|
class |
EdgeTargetDegrees<K,VV,EV>
Annotates edges of a directed graph with the degree, out-degree, and in-degree of the target
vertex.
|
class |
VertexDegrees<K,VV,EV>
Annotates vertices of a directed graph with the degree, out-, and in-degree.
|
class |
VertexInDegree<K,VV,EV>
Annotates vertices of a directed graph with the in-degree.
|
class |
VertexOutDegree<K,VV,EV>
Annotates vertices of a directed graph with the out-degree.
|
Modifier and Type | Class and Description |
---|---|
class |
EdgeDegreePair<K,VV,EV>
Annotates edges of an undirected graph with the degree of both the source and target degree
vertices.
|
class |
EdgeSourceDegree<K,VV,EV>
Annotates edges of an undirected graph with degree of the source vertex.
|
class |
EdgeTargetDegree<K,VV,EV>
Annotates edges of an undirected graph with degree of the target vertex.
|
class |
VertexDegree<K,VV,EV>
Annotates vertices of an undirected graph with the degree.
|
Modifier and Type | Class and Description |
---|---|
class |
TriangleListingBase<K,VV,EV,R>
Common configuration for directed and undirected Triangle Listing algorithms.
|
Modifier and Type | Class and Description |
---|---|
class |
LocalClusteringCoefficient<K extends Comparable<K> & CopyableValue<K>,VV,EV>
The local clustering coefficient measures the connectedness of each vertex's neighborhood.
|
class |
TriangleListing<K extends Comparable<K> & CopyableValue<K>,VV,EV>
Generates a listing of distinct triangles from the input graph.
|
Modifier and Type | Class and Description |
---|---|
class |
HITS<K,VV,EV>
Hyperlink-Induced Topic Search computes two interdependent scores for every vertex in a directed
graph.
|
class |
PageRank<K,VV,EV>
PageRank computes a per-vertex score which is the sum of PageRank scores transmitted over
in-edges.
|
Modifier and Type | Class and Description |
---|---|
class |
AdamicAdar<K extends CopyableValue<K>,VV,EV>
http://social.cs.uiuc.edu/class/cs591kgk/friendsadamic.pdf
|
class |
JaccardIndex<K extends CopyableValue<K>,VV,EV>
The Jaccard Index measures the similarity between vertex neighborhoods and is computed as the
number of shared neighbors divided by the number of distinct neighbors.
|
Copyright © 2014–2023 The Apache Software Foundation. All rights reserved.