Description
Add the inserted count to both vertices and edges and return it as edgeDelta.
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.
Add the inserted count to both vertices and edges and return it as edgeDelta.
When to use this tool
Use Edge Subdivision Vertex Edge Delta 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 vertices, edges, insertedVertices. Use the units and conventions below.
- Run the tool. Correct any format, range, or cross-field input error before interpreting the output.
- Read vertices, edges, edgeDelta. Use the output convention below.
Require at least two vertices, at least one edge, and nonnegative insertedVertices. Add the inserted count to both vertices and edges and return it as edgeDelta.1
| Input field | Meaning and units | Accepted input |
|---|---|---|
| vertices | Vertices | Required. Safe integer; minimum 2. |
| edges | Edges | Required. Safe integer; minimum 1. |
| insertedVertices | Inserted Vertices | Required. Safe integer; minimum 0. |
| Output field | Interpretation | Returned shape |
|---|---|---|
| vertices | Vertices | Required. Safe integer. |
| edges | Edges | Required. Safe integer. |
| edgeDelta | Edge Delta | Required. Safe integer. |
{
"input": {
"vertices": 5,
"edges": 6,
"insertedVertices": 2
},
"output": {
"vertices": 7,
"edges": 8,
"edgeDelta": 2
}
}Limitations and assumptions
- This assumes subdividing one existing edge into a chain; actual graph structure, selected edge, and mutation are not inspected or performed.
- 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 Contraction Selfloop Count Delta
Add edgesBetween to loop count only when keepContractedEdges, otherwise preserve existingLoops.
- 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.