Bridge (graph theory)Isthme
Edge whose deletion would disconnect a graph
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.En théorie des graphes, un isthme ou un pont est une arête d'un graphe dont l'élimination induit un graphe avec plus de composantes connexes que le graphe initial.
