Description
Subtract each from nodes-1 for the directed complement degrees.
A graph's degree records how many edge incidences meet a vertex. Directed edges distinguish incoming and outgoing incidences, while loops and parallel edges require explicit counting conventions; a local degree formula does not reconstruct a graph.
Subtract each from nodes-1 for the directed complement degrees.
When to use this tool
Use Directed Complement One Node Degree when you need a degree or incidence calculation under the stated graph convention.
How to use the tool and how it works
- Enter nodes, outDegree, inDegree. Use the units and conventions below.
- Run the tool. Correct any format, range, or cross-field input error before interpreting the output.
- Read outDegree, inDegree. Use the output convention below.
Require positive nodes and inDegree and outDegree each within 0 to nodes-1. Subtract each from nodes-1 for the directed complement degrees.1
| Input field | Meaning and units | Accepted input |
|---|---|---|
| nodes | Nodes | Required. Safe integer; minimum 1. |
| outDegree | Out Degree | Required. Safe integer; minimum 0. |
| inDegree | In Degree | Required. Safe integer; minimum 0. |
| Output field | Interpretation | Returned shape |
|---|---|---|
| outDegree | Out Degree | Required. Safe integer. |
| inDegree | In Degree | Required. Safe integer. |
{
"input": {
"nodes": 6,
"outDegree": 2,
"inDegree": 3
},
"output": {
"outDegree": 3,
"inDegree": 2
}
}Limitations and assumptions
- The rule assumes a simple loop-free directed graph on the same vertices; actual degrees, edges, and complement membership are not inspected.
- 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
Build an adjacency structure and count actual incidences when a full graph is available. Validate loop, multiplicity, direction, and vertex-set assumptions before applying a simple-graph identity.
References
Similar or alternative tools
- Directed Loop In Out Degree Pair
Return that count as both inDegree and outDegree and twice it as totalDegree.
- Graph Degree Sequence Single Node Budget
Return nodes-1-degree as remainingNeighbors and feasible when degree is below nodes.