Description
Record the unit and reference attached to a graph edge weight.
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.
Record the unit and reference attached to a graph edge weight.
When to use this tool
Use Edge Weight Unit Reference Label when checking the stated graph degree, walk, key or entry-presence convention.
How to use the tool and how it works
- Enter graphId, weightMeaning, unitText. Use the units and conventions below.
- Run the tool. Correct any format, range, or cross-field input error before interpreting the output.
- Read token. Use the output convention below.
Require nonempty graph ID, weight meaning and unit text. Encode the ordered triple as JSON text.1
| Input field | Meaning and units | Accepted input |
|---|---|---|
| graphId | Graph Id | Required. Text; minimum UTF-16 length 1; maximum UTF-16 length 8192. |
| weightMeaning | Weight Meaning | Required. Text; minimum UTF-16 length 1; maximum UTF-16 length 8192. |
| unitText | Unit Text | Required. Text; minimum UTF-16 length 1; maximum UTF-16 length 8192. |
| Output field | Interpretation | Returned shape |
|---|---|---|
| token | JSON-encoded ordered tuple or literal token under the convention above; not a database lookup or authentication result. | Required. Text; maximum UTF-16 length 8192. |
{
"input": {
"graphId": "G17",
"weightMeaning": "travel time",
"unitText": "s"
},
"output": {
"token": "[\"G17\",\"travel time\",\"s\"]"
}
}Limitations and assumptions
- This records the weight basis without validating dimensions, converting values or inspecting a graph.
- 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
- Multigraph Edge Key Occurrence Suffix
Build a multigraph edge-occurrence key with canonical endpoint order for undirected edges.
- Edge Loop Endpoint Check Tool
Check whether one graph edge is a self-loop by exact, case-sensitive endpoint identity.