DNSLbetweenness_for_graph: Computes betweenness via duplication of nodes with self-loops...

In dupNodes: Computes DNSLbetweenness, a Betweenness Measure that Includes Self-Loops

Computes betweenness via duplication of nodes with self-loops for a graph

Description

Computes the betweenness of nodes in a graph that includes self-loops directly.

Usage

DNSLbetweenness_for_graph(graph.with.self.loops)

Arguments

graph.with.self.loops

An igraph object some of whose nodes have connections with themselves (self-loops).

Details

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.

Value

A list with DNSLbetweenness values for the nodes in the graph.

References

\insertAllCited

Examples

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))))

dupNodes documentation built on June 22, 2024, 7:03 p.m.