Description
Require positive integer componentCount and add one after removal only when bridge is true.
Connected components partition a graph by reachability. Removing bridges creates an edge-connectivity partition; this differs from vertex-biconnected decomposition, which concerns articulation vertices and has different blocks.
Require positive integer componentCount and add one after removal only when bridge is true.
When to use this tool
Use Graph Bridge Single Cut Edge Budget when you need a component or bridge-related count under the specified undirected graph model.
How to use the tool and how it works
- Enter componentCount, bridge. Use the units and conventions below.
- Run the tool. Correct any format, range, or cross-field input error before interpreting the output.
- Read afterRemovalComponents. Use the output convention below.
Require positive integer componentCount and add one after removal only when bridge is true.1
| Input field | Meaning and units | Accepted input |
|---|---|---|
| componentCount | Component Count | Required. Safe integer; minimum 1. |
| bridge | Bridge | Required. Boolean. |
| Output field | Interpretation | Returned shape |
|---|---|---|
| afterRemovalComponents | After Removal Components | Required. Safe integer. |
{
"input": {
"componentCount": 2,
"bridge": true
},
"output": {
"afterRemovalComponents": 3
}
}Limitations and assumptions
- Bridge status is supplied rather than detected; no edge is removed and the result does not verify connectivity, multigraph conventions, or a valid bridge.
- Inputs must satisfy both the field types and the cross-field conditions above. Invalid input causes an error; a successful false flag or documented placeholder is a different result.
- Numeric calculations use binary floating point unless exact decimal-integer arithmetic is explicitly stated. No hidden measurement tolerance or decimal rounding is added; nonfinite or out-of-contract results are rejected. Numeric signed-zero results are exported as zero.
Alternative or Complementary methods
Traverse the supplied graph for an independently derived partition. Use articulation-point and vertex-biconnected algorithms when vertex removal, rather than edge removal, is the relevant failure model.
References
Similar or alternative tools
- Edge Biconnected Component Count
Traverse the undirected edge-indexed adjacency to identify bridges using discovery and low-link values, then count vertex components reachable without bridge edges.
- Edge Contraction Selfloop Count Delta
Add edgesBetween to loop count only when keepContractedEdges, otherwise preserve existingLoops.