Description Usage Arguments Value Examples
An edge in an undirected connected graph is a bridge iff removing it disconnects the graph. For a disconnected undirected graph, definition is similar, a bridge is an edge removing which increases number of disconnected components. Function is available in igraph C version, but not in R. Solution proposed by Szabolcs Horvát.
1 | getBridges(g)
|
g |
An igraph object |
an igraph.es edge sequence.
1 2 3 4 5 6 7 | library(igraph)
set.seed(523)
g = erdos.renyi.game(100, 120, 'gnm')
bridges = getBridges(g)
E(g)$color = "gray"
E(g)[bridges]$color = "red"
plot(g, vertex.size=6, vertex.label=NA)
|
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.