Knowledge graph
Typed edge
A typed edge is a relationship with a named kind - such as alternative, integrates_with, depends_on, or successor - so the connection is precise.
A typed edge carries a relationship type, not just a link. In GraphCanon the types include alternative, related, integrates_with, depends_on, and successor. Each can also carry an explanation and direction.
Typing is what lets the graph answer specific questions - "what are direct alternatives?" versus "what does this depend on?" - instead of a vague "see also".
In GraphCanon
Typed edges power alternatives, compare pages, and stacks. Each edge records where it came from (provenance), so a claim like "X is a successor to Y" is auditable.
See also
Related terms
Last reviewed 2026-07-09