Knowledge graph
Edge (relationship)
Also known as: Relationship, Relation
An edge is a connection between two nodes - the relationship that makes a graph a graph.
An edge links two nodes. It can be directed (A points to B) and can carry a type and an explanation, so the connection means something specific rather than just "related".
Edges are what you traverse: follow them to move from a tool to its alternatives, its integrations, or the tool that superseded it.
In GraphCanon
GraphCanon separates curated graph edges (typed relationships from ingest/enrich) from category neighbours (same-category discovery). Curated edges are decision-grade; neighbours are exploratory.
See also
Related terms
Last reviewed 2026-07-09