Represents the node centrality values as computed by DegreeCentrality.
Inheritance Hierarchy
Remarks
This class cannot be instantiated
Members
No filters for this type
Properties
Gets a mapping from each node to its absolute centrality value.
Gets a mapping from each node to its absolute centrality value.
The absolute centrality value can change drastically depending on graph structure and edge weights. The normalizedNodeCentrality values don't usually change as much, while still allowing to determine relative importance between nodes. If a subgraph is specified for the algorithm, the value is
-1 for all nodes that are not part of the subgraph.readonlyfinal
Gets a mapping from each node to its normalized centrality value.
Gets a mapping from each node to its normalized centrality value.
The normalized value is obtained by dividing nodeCentrality by maximumNodeCentrality. Thus the normalized values are all between
0 and 1. If a subgraph is specified for the algorithm, the value is -1 for all nodes that are not part of the subgraph.readonlyfinal