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:
“Oh, who will now be able to relate how Pantagruel behaved in face of these three hundred giants! Oh my muse, my Calliope, my Thalie, inspire me now, restore my spirits, because here is the ass’s bridge of logic, here is the pitfall, here is the difficulty of being able to describe the horrible battle undertaken.”
—François Rabelais (1494–1553)