| Distance
Centrality |
|
|
|
|
|
|
|
|
|
| ¡ | Closeness =
minimal distance |
|||||||
| ¡ | Sum of shortest
paths should be |
|||||||
| minimal in a
central graph |
||||||||
| ¡ | ____________ =
subset of nodes that |
|||||||
| have minimal
sum distance to all |
||||||||
| nodes. |
||||||||
| What about
disconnected components? |
||||||||
