Adjacency List
A common way to represent graphs in computer science.
An adjacency list is a common way to represent graphs in computer science. Instead of storing all possible connections (as an adjacency matrix does), it stores for each vertex, a list of its adjacent vertices. This representation is space-efficient when the graph has relatively few edges.
Built by Tim Jones