Find Bridging Edges in Networks

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.


  • [Snapshot]
  • [Snapshot]
  • [Snapshot]


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.
    • Share:

Embed Interactive Demonstration New!

Just copy and paste this snippet of JavaScript code into your website or blog to put the live Demonstration on your site. More details »

Files require Wolfram CDF Player or Mathematica.