liveBook · Manning

Relationship type

A relationship type is a label or category identifying the kind of connection represented by an edge in a graph.

How 2 Manning books explain it

Graph Neural Networks in Action

An edge type is a category identifying the kind of relationship represented by a graph edge.

How it is used
Distinguishes known molecular bond categories or represents inferred connections used to predict future graph states and trajectories.
How deep it goes
Works through relation-specific message-passing parameters and a probability-to-sampled-edge inference pipeline, without deriving their mathematics.
Examples
Uses single, double, triple, and aromatic molecular bonds alongside connected-versus-unconnected sensors and possible sports-team passing links.
What you can do after
Build it from scratch with relation-specific message passing, or apply edge-type sampling to infer connectivity for trajectory prediction.

Read how Graph Neural Networks in Action explains relationship type →

Graph Algorithms for Data Science

A relationship type is a label that identifies the kind of connection represented by a graph relationship.

How it is used
Uses relationship types to model and query meaningful connections in social, business, geographic, and other graph domains.
How deep it goes
Explains relationship semantics, direction, properties, naming quality, and graph triples without descending into database implementation internals.
Examples
Demonstrates FRIEND, WRITES_FOR, EMPLOYED_BY, IS_IN, HAS_TAG, and SIMILAR relationships through graph models, Cypher listings, and network projections.
What you can do after
Apply relationship types via Cypher to create, retrieve, traverse, and interpret typed graph connections.

Read how Graph Algorithms for Data Science explains relationship type →

Related concepts

These guides are generated from the text of Manning books by Manning's knowledge graph and link to the sections they draw on. The full books are available on liveBook and at manning.com.