Bridge (graph Theory)
In graph theory, a bridge (also known as a cut-edge or cut arc or an isthmus) is an edge whose deletion increases the number of connected components. Equivalently, an edge is a bridge if and only if it is not contained in any cycle. A graph is said to be bridgeless if it contains no bridges.
Read more about Bridge (graph Theory): Trees and Forests, Relation To Vertex Connectivity, Bridgeless Graphs, Bridge-finding Algorithm
Famous quotes containing the word bridge:
“What need the bridge much broader than the flood?”
—William Shakespeare (1564–1616)