June 2020
Intermediate to advanced
382 pages
11h 39m
English
Content preview from 40 Algorithms Every Programmer Should Know
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
Start your free trial
Fairness and closeness
Let's take a graph, g. The fairness of vertex a in graph g is defined as the sum of vertex a's distance from other vertices. Note that the centrality of a particular vertex quantifies its total distance from all the other vertices.
The opposite of fairness is closeness.