brandes.betweenness.centrality {RBGL}R Documentation

Compute betweenness centrality for an undirected graph

Description

Compute betweenness centrality for an undirected graph

Usage

brandes.betweenness.centrality(g)

Arguments

g an instance of the graph class with edgemode “undirected”

Details

brandes.betweenness.centrality computes the betweenness centrality of each vertex or each edge in the graph. You can find the definitions of betweenness centrality for vertex and edges and the details of the algorithm in the documentation on brandes betweenness centrality in Boost Graph Library.

Value

A list of

betweenness.centrality.vertices betweenness centrality of each vertex
betweenness.centrality.edges betweenness centrality of each edge
relative.betweenness.centrality.vertices relative betweenness centrality of each vertex
dominance maximum betweenness of any point in the graph

Author(s)

Li Long <li.long@isb-sib.ch>

References

Boost Graph Library by Siek et al.

See Also

Examples

coex <- fromGXL(file(system.file("XML/conn.gxl",package="RBGL")))
coex@edgemode <- "undirected"
brandes.betweenness.centrality(coex)

[Package RBGL version 1.3.13 Index]