Critical Bridges Solver
PropertiesMediumDetect critical bridge edges whose deletion disconnects the undirected graph.
Alt+Shift+R
Configuration Panel
Click run to trace back-edges. Bridge edges are highlighted in yellow on the canvas.
Complexity Mappings
Time ComplexityO(V + E)
Space ComplexityO(V) recursion times tables
Interactive SVG Graph Canvas
🖱️ Middle-drag to Pan🎡 Scroll wheel to Zoom⌨️ Shift-drag snap to 20px grid
Inspector Panel
Select a vertex or edge to inspect details.
Graph Wizard
Conceptual Overview
A Bridge (cut edge) is an edge in a graph whose deletion increases the graph's number of connected components (disconnects a portion of the graph).
Algorithm Mechanism
Computes discovery time tin[u] and lowest reachable time low[u] via DFS. If a neighbor v has low[v] > tin[u], then u-v is a bridge because v has no back-edges to ancestors of u.
Source: CP-Algorithms reference guide