How deeply does Graph Neural Networks in Action cover adjacency list?

Defines the representation and walks through Python construction, serialization, and undirected-connection handling without covering algorithmic complexity.

Adjacency list

As explained in Graph Neural Networks in Action

An adjacency list is a graph representation that records the neighboring nodes associated with each node.

An adjacency list represents a graph by assigning each node a list of its neighboring nodes. It is useful when graph relationships must remain easy to inspect, transform, and serialize. section 8.3 section 8.3.2

A practical graph-data workflow uses an adjacency list as follows:

Choose a graph schema containing nodes and relationships. section 8.0
Convert raw JSON or CSV relationships into an adjacency list, often alongside an edge list. section 8.3.2
Store each node and its neighbors in a dictionary or text file, then serialize the result for reuse. section 4.2.2 section 8.3.2
Load the representation into NetworkX for exploration and visualization, or into PyTorch Geometric for preprocessing. section 8.3.2

Recruitment referrals

A candidate-referral dictionary uses each referring member as a key and referred candidates as values. The conversion function writes one line per member followed by related member hashes; for an undirected graph, it adds reciprocal connections. section 8.3.2

How Graph Neural Networks in Action covers it

Cover of Graph Neural Networks in Action

liveBook manning.com

Read Graph Neural Networks in Action on liveBook Get the book at manning.com

Also explained in

liveBook manning.com

Classic Computer Science Problems in Swift: Essential techniques for practicing programmersA graph representation that stores, for each vertex, the vertices or edges directly connected to it.
liveBook manning.com

Grokking Data StructuresAn adjacency list is a graph representation that associates each source vertex with a collection of its outgoing edges or destination vertices.
liveBook manning.com

Advanced Algorithms and Data StructuresAn adjacency list is a graph representation that stores, for each vertex, a list of its incident or outgoing edges and neighboring vertices.
liveBook manning.com

Learn Haskell by ExampleAn adjacency map is a graph representation that maps each node to a list of nodes connected from it.

Compare how 5 books explain adjacency list →

Related concepts

graphused by · A graph is a mathematical structure consisting of vertices connected by edges that represent relationships or connections.
adjacency matrixalternative to · An adjacency matrix is a square matrix whose rows and columns represent graph vertices and whose entries indicate edges or encode edge weights between vertex pairs.
edge crossoverused by · A permutation crossover operator that constructs offspring by preserving adjacency and connectivity information from parent permutations.
graph convolutional networkuses · A graph convolutional network is a graph neural network that computes representations by transforming and aggregating information from graph neighborhoods.
linked listuses · An ordered sequence of elements stored in separate nodes connected by links or references rather than in one contiguous storage region.
sparse graphuses · A sparse graph is a graph with relatively few edges compared with the number of possible edges among its vertices.

This explainer was generated by Manning's knowledge graph from the text of Graph Neural Networks in Action. The section links point to the parts of the book it draws on.