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 | Method and Description |
---|---|
protected boolean |
VertexOutDegree.mergeConfiguration(GraphAlgorithmDelegatingDataSet other) |
protected boolean |
VertexInDegree.mergeConfiguration(GraphAlgorithmDelegatingDataSet other) |
protected boolean |
VertexDegrees.mergeConfiguration(GraphAlgorithmDelegatingDataSet other) |
protected boolean |
EdgeTargetDegrees.mergeConfiguration(GraphAlgorithmDelegatingDataSet other) |
protected boolean |
EdgeSourceDegrees.mergeConfiguration(GraphAlgorithmDelegatingDataSet other) |
protected boolean |
EdgeDegreesPair.mergeConfiguration(GraphAlgorithmDelegatingDataSet other) |
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 | Method and Description |
---|---|
protected boolean |
VertexDegree.mergeConfiguration(GraphAlgorithmDelegatingDataSet other) |
protected boolean |
EdgeTargetDegree.mergeConfiguration(GraphAlgorithmDelegatingDataSet other) |
protected boolean |
EdgeSourceDegree.mergeConfiguration(GraphAlgorithmDelegatingDataSet other) |
protected boolean |
EdgeDegreePair.mergeConfiguration(GraphAlgorithmDelegatingDataSet other) |
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 | Method and Description |
---|---|
protected boolean |
TriangleListing.mergeConfiguration(GraphAlgorithmDelegatingDataSet other) |
protected boolean |
LocalClusteringCoefficient.mergeConfiguration(GraphAlgorithmDelegatingDataSet other) |
Modifier and Type | Method and Description |
---|---|
protected boolean |
TriangleListing.mergeConfiguration(GraphAlgorithmDelegatingDataSet other) |
protected boolean |
LocalClusteringCoefficient.mergeConfiguration(GraphAlgorithmDelegatingDataSet other) |
Modifier and Type | Class and Description |
---|---|
class |
HITS<K,VV,EV>
http://www.cs.cornell.edu/home/kleinber/auth.pdf
Hyperlink-Induced Topic Search computes two interdependent scores for every
vertex in a directed graph.
|
Modifier and Type | Method and Description |
---|---|
protected boolean |
HITS.mergeConfiguration(GraphAlgorithmDelegatingDataSet other) |
Modifier and Type | Class and Description |
---|---|
class |
AdamicAdar<K extends CopyableValue<K>,VV,EV>
http://social.cs.uiuc.edu/class/cs591kgk/friendsadamic.pdf
Adamic-Adar measures the similarity between pairs of vertices as the sum of the inverse logarithm of degree over shared neighbors. |
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.
|
Modifier and Type | Method and Description |
---|---|
protected boolean |
JaccardIndex.mergeConfiguration(GraphAlgorithmDelegatingDataSet other) |
protected boolean |
AdamicAdar.mergeConfiguration(GraphAlgorithmDelegatingDataSet other) |
Modifier and Type | Method and Description |
---|---|
protected abstract boolean |
GraphAlgorithmDelegatingDataSet.mergeConfiguration(GraphAlgorithmDelegatingDataSet other)
An algorithm must first test whether the configurations can be merged
before merging individual fields.
|
Copyright © 2014–2017 The Apache Software Foundation. All rights reserved.