centrality
How important a node is within a graph. Each centrality algorithm defines importance differently.
Example
Ben has three relationships. Every route between Eve and the rest runs through Dan.
Degree centrality scores Ben 3 and Dan 2, counting the relationships going out of each. These are undirected, so every relationship goes out of both of its nodes.
Betweenness scores Ben 5 and Dan 3, counting the shortest paths between other people that pass through each.
Lessons that use this term
The lesson and course links below open in a new tab.
No published lesson uses this term yet.