getBridges: Get bridges edges of a graph

Description Usage Arguments Value Examples

View source: R/getEdges.R

Description

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.

Usage

1

Arguments

g

An igraph object

Value

an igraph.es edge sequence.

Examples

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)

MiloMonnier/supplynet documentation built on Feb. 16, 2021, 8:03 p.m.