Represents the node centrality values as computed by ClosenessCentrality.
Inheritance Hierarchy
ClosenessCentralityResult
Type Details
- yfiles module
- view-layout-bridge
- yfiles-umd modules
- view-layout-bridge
- Legacy UMD name
- yfiles.analysis.ClosenessCentralityResult
Properties
Gets a mapping from each node to its absolute centrality value.
Remarks
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.Gets a mapping from each node to its normalized centrality value.
Remarks
The normalized value is obtained by dividing nodeCentrality by maximumNodeCentrality. Thus the normalized values are all between 0 and 1.
If the graph contains only one single node its normalized value will be positive infinity.
If a subgraph is specified for the algorithm, though, the value is -1 for all nodes that are not part of the subgraph.