View source: R/DNSLbetweenness_for_graph.R
DNSLbetweenness_for_graph | R Documentation |
Computes the betweenness of nodes in a graph that includes self-loops directly.
DNSLbetweenness_for_graph(graph.with.self.loops)
graph.with.self.loops |
An |
This method computes betweenness centrality via the duplicated nodes method \insertCitemm24:intra_family_linksdupNodes for a 'igraph' object. Use it when you want to just apply the DNSLbetweenness method to an already built graph. The intermediate graph obtained by duplicating nodes is hidden and discarded.
A list with DNSLbetweenness values for the nodes in the graph.
library(igraph)
V1 <- c("A", "A","B","C","D","E")
V2 <- c("A", "B","C","D","E","A")
print(DNSLbetweenness_for_graph(graph_from_data_frame(data.frame(V1,V2))))
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.