Description
Return reciprocal when both flags are true and count one edge for a present self-loop or the separate directed flags otherwise.
Graph identifiers and endpoints describe different kinds of equality. Two edges can connect the same vertices while remaining distinct records, and serialized numeric or string identifiers can lose distinctions during parsing or normalization.
Return reciprocal when both flags are true and count one edge for a present self-loop or the separate directed flags otherwise.
When to use this tool
Use Edge Reciprocity Indicator when you need a literal identifier or endpoint comparison with explicit coercion rules.
How to use the tool and how it works
- Enter forwardPresent, reversePresent, selfLoop. Use the units and conventions below.
- Run the tool. Correct any format, range, or cross-field input error before interpreting the output.
- Read reciprocal, directedEdgeCount. Inspect reciprocal before interpreting the associated values.
Require equal forward and reverse flags for a self-loop. Return reciprocal when both flags are true and count one edge for a present self-loop or the separate directed flags otherwise.1
| Input field | Meaning and units | Accepted input |
|---|---|---|
| forwardPresent | Forward Present | Required. Boolean. |
| reversePresent | Reverse Present | Required. Boolean. |
| selfLoop | Self Loop | Required. Boolean. |
| Output field | Interpretation | Returned shape |
|---|---|---|
| reciprocal | Reciprocal | Required. Boolean. |
| directedEdgeCount | Directed Edge Count | Required. Safe integer. |
{
"input": {
"forwardPresent": true,
"reversePresent": true,
"selfLoop": false
},
"output": {
"reciprocal": true,
"directedEdgeCount": 2
}
}Limitations and assumptions
- The loop designation and edge-presence flags are supplied; no actual endpoints, adjacency, or global reciprocity statistic is 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.
Alternative or Complementary methods
Retain original identifiers and use a declared canonical representation for storage. Resolve actual edge identity through the graph's data model rather than endpoint coincidence alone.
References
Similar or alternative tools
- Edge List Single Edge Canonical Order
Compare source and target using JavaScript string ordering, swap them when source is greater, and return reversed.
- Multigraph Parallel Edge Identity Token
Compare edge IDs literally and compare endpoint order, allowing reversed endpoints only when directed is false.