Description Usage Arguments Details Value Author(s) References Examples

Geodesic K-path centrality counts neighbours as those that are on a geodesic path less than "k" away.

1 2 |

`graph` |
The input graph as igraph object |

`vids` |
Vertex sequence, the vertices for which the centrality values are returned. Default is all vertices. |

`mode` |
Character constant, gives whether the shortest paths to or from the given vertices should be calculated for directed graphs. If out then the shortest paths from the vertex, if in then to it will be considered. If all, the default, then the corresponding undirected graph will be used, ie. not directed paths are searched. This argument is ignored for undirected graphs. |

`weights` |
Possibly a numeric vector giving edge weights. If this is NULL, the default, and the graph has a weight edge attribute, then the attribute is used. If this is NA then no weights are used (even if the graph has a weight attribute). |

`k` |
The k parameter. The default is 3. |

More detail at Geodesic K-Path Centrality

A numeric vector contaning the centrality scores for the selected vertices.

Mahdi Jalili [email protected]

Borgatti, Stephen P., and Martin G. Everett. "A graph-theoretic perspective on centrality." Social networks 28.4 (2006): 466-484.

1 2 | ```
g <- barabasi.game(100)
geokpath(g)
``` |

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.