bridges: Bridges.

Description Usage Arguments Details Value Author(s) References Examples

Description

Find bridges in an undirected graph.

Usage

1

Arguments

x

An undirected graph. Can be an igraph object, an adjacency matrix, an edgelist.

Details

Find bridges using the algorithm by Schmidt (2013)

Value

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.

Author(s)

Giulio Costantini

References

Schmidt (2013), A simple test on 2-vertex- and 2-edge-connectivity. Information Processing Letters 113, 241-244.

Examples

1
2
x <- igraph::barabasi.game(n=30)
bridges(x)

GiulioCostantini/TOMproject documentation built on May 6, 2019, 6:29 p.m.