public static interface LightningApi.NodeMetricsResponseOrBuilder
extends com.google.protobuf.MessageOrBuilder
Modifier and Type | Method and Description |
---|---|
boolean |
containsBetweennessCentrality(java.lang.String key)
Betweenness centrality is the sum of the ratio of shortest paths that pass
through the node for each pair of nodes in the graph (not counting paths
starting or ending at this node).
|
java.util.Map<java.lang.String,LightningApi.FloatMetric> |
getBetweennessCentrality()
Deprecated.
|
int |
getBetweennessCentralityCount()
Betweenness centrality is the sum of the ratio of shortest paths that pass
through the node for each pair of nodes in the graph (not counting paths
starting or ending at this node).
|
java.util.Map<java.lang.String,LightningApi.FloatMetric> |
getBetweennessCentralityMap()
Betweenness centrality is the sum of the ratio of shortest paths that pass
through the node for each pair of nodes in the graph (not counting paths
starting or ending at this node).
|
LightningApi.FloatMetric |
getBetweennessCentralityOrDefault(java.lang.String key,
LightningApi.FloatMetric defaultValue)
Betweenness centrality is the sum of the ratio of shortest paths that pass
through the node for each pair of nodes in the graph (not counting paths
starting or ending at this node).
|
LightningApi.FloatMetric |
getBetweennessCentralityOrThrow(java.lang.String key)
Betweenness centrality is the sum of the ratio of shortest paths that pass
through the node for each pair of nodes in the graph (not counting paths
starting or ending at this node).
|
findInitializationErrors, getAllFields, getDefaultInstanceForType, getDescriptorForType, getField, getInitializationErrorString, getOneofFieldDescriptor, getRepeatedField, getRepeatedFieldCount, getUnknownFields, hasField, hasOneof
int getBetweennessCentralityCount()
Betweenness centrality is the sum of the ratio of shortest paths that pass through the node for each pair of nodes in the graph (not counting paths starting or ending at this node). Map of node pubkey to betweenness centrality of the node. Normalized values are in the [0,1] closed interval.
map<string, .lnrpc.FloatMetric> betweenness_centrality = 1;
boolean containsBetweennessCentrality(java.lang.String key)
Betweenness centrality is the sum of the ratio of shortest paths that pass through the node for each pair of nodes in the graph (not counting paths starting or ending at this node). Map of node pubkey to betweenness centrality of the node. Normalized values are in the [0,1] closed interval.
map<string, .lnrpc.FloatMetric> betweenness_centrality = 1;
@Deprecated java.util.Map<java.lang.String,LightningApi.FloatMetric> getBetweennessCentrality()
getBetweennessCentralityMap()
instead.java.util.Map<java.lang.String,LightningApi.FloatMetric> getBetweennessCentralityMap()
Betweenness centrality is the sum of the ratio of shortest paths that pass through the node for each pair of nodes in the graph (not counting paths starting or ending at this node). Map of node pubkey to betweenness centrality of the node. Normalized values are in the [0,1] closed interval.
map<string, .lnrpc.FloatMetric> betweenness_centrality = 1;
LightningApi.FloatMetric getBetweennessCentralityOrDefault(java.lang.String key, LightningApi.FloatMetric defaultValue)
Betweenness centrality is the sum of the ratio of shortest paths that pass through the node for each pair of nodes in the graph (not counting paths starting or ending at this node). Map of node pubkey to betweenness centrality of the node. Normalized values are in the [0,1] closed interval.
map<string, .lnrpc.FloatMetric> betweenness_centrality = 1;
LightningApi.FloatMetric getBetweennessCentralityOrThrow(java.lang.String key)
Betweenness centrality is the sum of the ratio of shortest paths that pass through the node for each pair of nodes in the graph (not counting paths starting or ending at this node). Map of node pubkey to betweenness centrality of the node. Normalized values are in the [0,1] closed interval.
map<string, .lnrpc.FloatMetric> betweenness_centrality = 1;