Skip to content

Main content

Multigraph Parallel Edge Identity Token Tool

Distinguish explicit edge identity from endpoint coincidence in a directed or undirected multigraph.

Loading tool…

Description

Compare edge IDs literally and compare endpoint order, allowing reversed endpoints only when directed is false.

Graph identifiers and endpoints describe different kinds of equality. Two edges can connect the same vertices while remaining distinct records, and serialized numeric or string identifiers can lose distinctions during parsing or normalization.

Compare edge IDs literally and compare endpoint order, allowing reversed endpoints only when directed is false.

When to use this tool

Use Multigraph Parallel Edge Identity Token when you need a literal identifier or endpoint comparison with explicit coercion rules.

How to use the tool and how it works

  1. Enter firstId, secondId, firstFrom, firstTo, secondFrom, secondTo, directed. Use the units and conventions below.
  2. Run the tool. Correct any format, range, or cross-field input error before interpreting the output.
  3. Read sameIdentity, parallelEndpoints, distinctParallelEdges. Inspect sameIdentity, parallelEndpoints, distinctParallelEdges before interpreting the associated values.

Compare edge IDs literally and compare endpoint order, allowing reversed endpoints only when directed is false. Mark distinctParallelEdges for unequal IDs with matching endpoints under that rule.1

Input fieldMeaning and unitsAccepted input
firstIdFirst IdRequired. Text; maximum UTF-16 length 8192.
secondIdSecond IdRequired. Text; maximum UTF-16 length 8192.
firstFromFirst FromRequired. Text; maximum UTF-16 length 8192.
firstToFirst ToRequired. Text; maximum UTF-16 length 8192.
secondFromSecond FromRequired. Text; maximum UTF-16 length 8192.
secondToSecond ToRequired. Text; maximum UTF-16 length 8192.
directedDirectedRequired. Boolean.
Output fieldInterpretationReturned shape
sameIdentitySame IdentityRequired. Boolean.
parallelEndpointsParallel EndpointsRequired. Boolean.
distinctParallelEdgesDistinct Parallel EdgesRequired. Boolean.
json
{
  "input": {
    "firstId": "e1",
    "secondId": "e2",
    "firstFrom": "A",
    "firstTo": "B",
    "secondFrom": "B",
    "secondTo": "A",
    "directed": false
  },
  "output": {
    "sameIdentity": false,
    "parallelEndpoints": true,
    "distinctParallelEdges": true
  }
}

Limitations and assumptions

  • Same ID with inconsistent endpoints still has sameIdentity true; graph membership, identifier authenticity, and the actual multiplicity are not verified.
  • 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

Retain original identifiers and use a declared canonical representation for storage. Resolve actual edge identity through the graph's data model rather than endpoint coincidence alone.

References

  1. Calculation and input contract: graph/multigraph-parallel-edge-identity-token — tool.io

Similar or alternative tools