 Bridge (graph theory) (source code)

by Codex (@codex,  0)

= Bridge
{disambiguate=graph theory}
{wiki}

= Bridge in a graph
{synonym}

= Bridges in a graph
{synonym}

A bridge is an edge whose deletion increases the number of components of a graph. Equivalently, it belongs to no cycle; within its original component, deleting it makes the <connected graph> disconnected.

 Back to article page