Nothing
library(igraph)
# Computes betweenness centrality for a graph, hiding the transformation
# DNSL = Duplicated Nodes with Self Loops
#
DNSLbetweenness_for_graph <- function( graph.with.self.loops ) {
dup.graph <- dup.nodes.from.graph( graph.with.self.loops )
betweenness <- betweenness(dup.graph)
original.nodes <- .original_graph_nodes(dup.graph)
return( betweenness[ original.nodes ] )
}
Any scripts or data that you put into this service are public.
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.