Description Usage Arguments Value Author(s) References See Also Examples

This function computes Dangalchev Closeness Centrality. This can be access by computing a network resistance. More specifically, it measures the closeness by removing nodes and edges. The evalauation of this measure of closeness will be easier and this can be useful for unconnected graphs too.

1 2 | ```
dangalchev_closeness_centrality(x, vids = V(x), mode = c("all", "out",
"in"), weights = NULL)
``` |

`x` |
An igraph or a network object |

`vids` |
Nodes to be considered in the calculation |

`mode` |
A Character value, indicating whether the shortest paths "in" or "out" of the nodes in the directed graphs should be considered. For undirected graphs we use "all". |

`weights` |
Numeric vector indicating weights of the edges |

a vector including centrality values for each node

Minoo Ashtiani, Mehdi Mirzaie, Mohieddin Jafari

DANGALCHEV, C. 2006. Residual closeness in networks. Physica A: Statistical Mechanics and its Applications, 365, 556-564. DOI: 10.1016/j.physa.2005.12.020

1 2 3 |

Embedding an R snippet on your website

Add the following code to your website.

For more information on customizing the embed code, read Embedding Snippets.