Description Usage Arguments Details Value Author(s) References Examples
Find bridges in an undirected graph.
1 | bridges(x)
|
x |
An undirected graph. Can be an igraph object, an adjacency matrix, an edgelist. |
Find bridges using the algorithm by Schmidt (2013)
A binary matrix of dimensions n = m = number of nodes. Each value one in position i,j indicates that the edge connecting nodes i and j is a bridge.
Giulio Costantini
Schmidt (2013), A simple test on 2-vertex- and 2-edge-connectivity. Information Processing Letters 113, 241-244.
1 2 | x <- igraph::barabasi.game(n=30)
bridges(x)
|
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.