The Bridge cardBridge

Bridge

graph theory

Common

Rarity: Common

The most frequent rarity: most Wikipedia articles become Commons.

Rarity follows how well known the article is: its views on the French and English Wikipedia over a year, and the number of languages it exists in.

At a glance

Class
Notion
Domain
Science and technology
In collections
Nobody has pulled it yet.

What Wikipedia says

In graph theory, a bridge, isthmus, cut-edge, or cut arc is an edge of a graph whose deletion increases the graph's number of connected components. Equivalently, an edge is a bridge if and only if it is not contained in any cycle. For a connected graph, a bridge can uniquely determine a cut.

Excerpt from the Wikipedia article “Bridge (graph theory)”, under the CC BY-SA 4.0 license. Read the article on Wikipedia

Image: User:Booyabazooka, CC BY-SA 3.0, via Wikimedia Commons.

Open free boosters and add Bridge to your collection.

Play for free

Related cards