Description
Return its numeric String when reachable, otherwise text ∞ and finite false.
A walk is an ordered sequence of visited vertices or edges, while a path normally adds structural restrictions. Sequence manipulation and endpoint checks alone do not verify that every required graph edge exists.
Return its numeric String when reachable, otherwise text ∞ and finite false.
When to use this tool
Use Disconnected Distance Infinity Token when you need a sequence transformation, endpoint comparison, or path-related local calculation.
How to use the tool and how it works
- Enter reachable, distance. Use the units and conventions below.
- Run the tool. Correct any format, range, or cross-field input error before interpreting the output.
- Read text, finite. Inspect finite before interpreting the associated values.
Require nonnegative distance. Return its numeric String when reachable, otherwise text ∞ and finite false.1
| Input field | Meaning and units | Accepted input |
|---|---|---|
| reachable | Reachable | Required. Boolean. |
| distance | Nonnegative supplied finite distance, still validated when reachable is false. | Required. Finite number; minimum 0. |
| Output field | Interpretation | Returned shape |
|---|---|---|
| text | Distance text or the infinity symbol when unreachable; not a numeric infinity. | Required. Text; maximum UTF-16 length 8192. |
| finite | Finite | Required. Boolean. |
{
"input": {
"reachable": false,
"distance": 0
},
"output": {
"text": "∞",
"finite": false
}
}Limitations and assumptions
- Distance is validated even when unreachable and ∞ is display text rather than JSON numeric infinity; no path search or actual reachability is 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
Validate each consecutive edge against the graph and check the required path or cycle properties. Use a dedicated traversal or shortest-path algorithm when reachability or optimality is the real question.
References
Similar or alternative tools
- Tree Center Eccentricity Explicit Gap
Return eccentricity-radius and mark center for an exact zero gap.
- Bfs Layer Edge Level Gap
For directed edges allow any gap at most one; for undirected edges require absolute gap at most one.