Find Bridging Edges in Networks

Initializing live version
Download to Desktop

Requires a Wolfram Notebook System

Interact on desktop, mobile and cloud with the free Wolfram Player or other Wolfram Language products.

A bridge in a network is an edge whose removal increases the number of connected components. A local bridge in this Demonstration is defined as an edge whose removal increases by two or more the shortest path distances between nearby nodes. You can vary the number of nodes and edges, creating a new random network.

Contributed by: Phillip Bonacich (March 2011)
Open content licensed under CC BY-NC-SA



M. S. Granovetter, "The Strength of Weak Ties," The American Journal of Sociology, 78(6), 1973 pp. 1360–1380.

S. Wasserman and K. Faust, Social Network Analysis: Methods and Applications, New York: Cambridge University Press, 1994.

Feedback (field required)
Email (field required) Name
Occupation Organization
Note: Your message & contact information may be shared with the author of any specific Demonstration for which you give feedback.