Description
Expose ambiguity between a present zero-weight edge and a zero-valued absence convention.
Graph records separate vertex/edge identities, direction, degree counts and weighted-entry conventions. A zero weight differs from no edge, and local degree balance or endpoint continuity does not establish a whole graph’s connectivity or a valid traversal. Parallel edges need an explicit occurrence convention.
Expose ambiguity between a present zero-weight edge and a zero-valued absence convention.
When to use this tool
Use Adjacency Entry Absent Zero Crosswalk when checking the stated graph degree, walk, key or entry-presence convention.
How to use the tool and how it works
- Enter edgePresent, suppliedWeight, absentUsesZero. Use the units and conventions below.
- Run the tool. Correct any format, range, or cross-field input error before interpreting the output.
- Read entryValue, weightIsAmbiguous. Inspect weightIsAmbiguous before interpreting the associated values.
Return suppliedWeight when edgePresent, otherwise zero. weightIsAmbiguous is true only when the edge exists with zero weight and absence is also encoded as zero.1
| Input field | Meaning and units | Accepted input |
|---|---|---|
| edgePresent | Edge Present | Required. Boolean. |
| suppliedWeight | Supplied Weight | Required. Finite number. |
| absentUsesZero | Absent Uses Zero | Required. Boolean. |
| Output field | Interpretation | Returned shape |
|---|---|---|
| entryValue | Entry Value | Required. Finite number. |
| weightIsAmbiguous | True only for a present zero-weight edge when absence also uses zero. | Required. Boolean. |
{
"input": {
"edgePresent": true,
"suppliedWeight": 0,
"absentUsesZero": true
},
"output": {
"entryValue": 0,
"weightIsAmbiguous": true
}
}Limitations and assumptions
- The flag describes this present zero-weight entry, not every possible matrix ambiguity; no adjacency matrix or graph is constructed.
- 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
Use the complete graph and appropriate structural/traversal algorithms for realizability, connectivity, Eulerian properties and globally unique edge handling.
References
Similar or alternative tools
- Edge Weight Unit Reference Label
Record the unit and reference attached to a graph edge weight.
- Multigraph Edge Key Occurrence Suffix
Build a multigraph edge-occurrence key with canonical endpoint order for undirected edges.