Description
Locate discontinuities between consecutive directed edge endpoints in a supplied walk.
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.
Locate discontinuities between consecutive directed edge endpoints in a supplied walk.
When to use this tool
Use Graph Walk Edge Continuity when checking the stated graph degree, walk, key or entry-presence convention.
How to use the tool and how it works
- Enter edgeSources, edgeTargets. Follow any array-alignment requirements below. Use the units and conventions below.
- Run the tool. Correct any format, range, or cross-field input error before interpreting the output.
- Read continuous, breakAfterIndices. Inspect continuous before interpreting the associated values.
Require aligned edge-source/target lists. Compare each target to the next source; return zero-based indices after which continuity breaks and continuous=true when none break.1
| Input field | Meaning and units | Accepted input |
|---|---|---|
| edgeSources | Edge Sources | Required. Array of text; maximum UTF-16 length 8192; maximum items 256. |
| edgeTargets | Edge Targets | Required. Array of text; maximum UTF-16 length 8192; maximum items 256. |
| Output field | Interpretation | Returned shape |
|---|---|---|
| continuous | Continuous | Required. Boolean. |
| breakAfterIndices | Zero-based positions i with target[i]!=source[i+1]; empty/single-edge lists have no breaks. | Required. Array of safe integer; maximum items 256. |
{
"input": {
"edgeSources": [
"A",
"B",
"X"
],
"edgeTargets": [
"B",
"C",
"Y"
]
},
"output": {
"continuous": false,
"breakAfterIndices": [
1
]
}
}Limitations and assumptions
- Empty and single-edge lists pass vacuously; no graph adjacency, edge identity or endpoint validity is checked.
- 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
Use the complete graph and appropriate structural/traversal algorithms for realizability, connectivity, Eulerian properties and globally unique edge handling.
References
Similar or alternative tools
- Path Terminal Vertex Parity Contribution
Count a vertex's occurrences in the two terminal positions of a path.
- Edge List Walk Validity Check
Verify consecutive vertex transitions against explicit directed or undirected edge observations; repeated vertices and edges are allowed in a walk.