liveBook · Manning

Edge list

An edge list is a graph representation consisting of records that identify each edge and its incident vertices or endpoints.

How 2 Manning books explain it

Graph Neural Networks in Action

An edge list is a graph representation consisting of records that enumerate the graph's edges and their incident nodes.

How it is used
Prepares raw relationship data for exploratory graph processing and graph neural network training.
How deep it goes
Defines edge lists and demonstrates serialization from a relationship dictionary, but defers broader graph-data-model details.
Examples
Uses recruiting relationships, CSV files, a relationship dictionary, and a function that writes node pairs to an edge-list file.
What you can do after
Build it from scratch by converting relationship data into a serialized edge-list file for NetworkX or PyTorch Geometric.

Read how Graph Neural Networks in Action explains edge list →

Build AI Drug Discovery Pipelines

An edge list is a graph representation consisting of records that specify the endpoint nodes of each edge.

How it is used
Represents sparse molecular connectivity for graph neural networks predicting drug-target affinity.
How deep it goes
Explains storage, sparse-graph efficiency, directed reversals, and self-loops, while deferring detailed edge features.
Examples
Uses aspirin representations and a Python SMILES-conversion workflow that extracts bonds, directed edges, and self-loops.
What you can do after
Apply it via RDKit and graph-processing code to convert molecular SMILES into edge-index data for GNN input.

Read how Build AI Drug Discovery Pipelines explains edge list →

Also covered in

What to know first

Related concepts

Questions about edge list

What is edge list?

An edge list is a graph representation consisting of records that identify each edge and its incident vertices or endpoints.

Which Manning books explain edge list?

Graph Neural Networks in Action and Build AI Drug Discovery Pipelines.

What should I know before learning edge list?

Manning books that teach edge list usually introduce graph and graph neural network first.

What is the difference between edge list and unconnected node?

An edge list is a graph representation consisting of records that identify each edge and its incident vertices or endpoints. An unconnected node is a graph node with no incident edges or relationships connecting it to other nodes.

What is edge list part of?

Edge list is part of graph. A graph is a mathematical structure consisting of vertices and edges that connect pairs of vertices to represent relationships or connections.

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.