Description
Return that count as both inDegree and outDegree and twice it as totalDegree.
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.
Return that count as both inDegree and outDegree and twice it as totalDegree.
When to use this tool
Use Directed Loop In Out Degree Pair when you need a degree or incidence calculation under the stated graph convention.
How to use the tool and how it works
- Enter loops. Use the units and conventions below.
- Run the tool. Correct any format, range, or cross-field input error before interpreting the output.
- Read inDegree, outDegree, totalDegree. Use the output convention below.
Require nonnegative integer loops. Return that count as both inDegree and outDegree and twice it as totalDegree.1
| Input field | Meaning and units | Accepted input |
|---|---|---|
| loops | Loops | Required. Safe integer; minimum 0. |
| Output field | Interpretation | Returned shape |
|---|---|---|
| inDegree | In Degree | Required. Safe integer. |
| outDegree | Out Degree | Required. Safe integer. |
| totalDegree | Total Degree | Required. Safe integer. |
{
"input": {
"loops": 3
},
"output": {
"inDegree": 3,
"outDegree": 3,
"totalDegree": 6
}
}Limitations and assumptions
- This is a directed-loop degree contribution rather than the vertex's complete degree; actual loops and other incident edges 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
- Vertex Loop Degree Contribution
Give each loop two degree contributions in an undirected graph or total directed degree, and one when directed and counting a single directed-degree side.
- Multigraph Loop Adjacency Diagonal Weight
Sum supplied loopWeights, double that sum on the adjacency diagonal only when doubleOnDiagonal, and always return twice the sum as degreeContribution.