Description
Require nonempty edgeId and endpoint IDs, retain edgeId, and swap sourceId with targetId.
A graph has vertices, edges, and a convention for direction, loops, and repeated edges. A local condition such as an edge count or degree sum may be necessary for a structure without proving that the full graph has that structure.
Require nonempty edgeId and endpoint IDs, retain edgeId, and swap sourceId with targetId.
When to use this tool
Use Directed Edge Reversal Record when you need one graph-record component or necessary structural check.
How to use the tool and how it works
- Enter edgeId, sourceId, targetId. Use the units and conventions below.
- Run the tool. Correct any format, range, or cross-field input error before interpreting the output.
- Read edgeId, sourceId, targetId. Use the output convention below.
Require nonempty edgeId and endpoint IDs, retain edgeId, and swap sourceId with targetId.1
| Input field | Meaning and units | Accepted input |
|---|---|---|
| edgeId | Edge Id | Required. Text; maximum UTF-16 length 8192. |
| sourceId | Identifier used to retain the supplied source context. | Required. Text; maximum UTF-16 length 8192. |
| targetId | Target Id | Required. Text; maximum UTF-16 length 8192. |
| Output field | Interpretation | Returned shape |
|---|---|---|
| edgeId | Edge Id | Required. Text; maximum UTF-16 length 8192. |
| sourceId | Identifier used to retain the supplied source context. | Required. Text; maximum UTF-16 length 8192. |
| targetId | Target Id | Required. Text; maximum UTF-16 length 8192. |
{
"input": {
"edgeId": "e7",
"sourceId": "A",
"targetId": "B"
},
"output": {
"edgeId": "e7",
"sourceId": "B",
"targetId": "A"
}
}Limitations and assumptions
- This reverses a returned record without mutating a graph, updating adjacency, checking edge uniqueness, or interpreting relation semantics.
- 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
Validate the complete graph, including connectivity and edge conventions, before drawing a structural conclusion.
References
Similar or alternative tools
- Edge Loop Endpoint Check
Require nonempty sourceId and targetId and return their exact equality as selfLoop.
- Mereology Part Relation Inverse
Return the whole as inverseSubject, has-part as inverseRelation, and the part as inverseObject.