Adjacency list

An adjacency list is a way to organize and represent a network or graph, where connections or links between points (called nodes or vertices) are stored efficiently. Instead of listing all possible connections in a big grid, each node maintains a list of nodes it's directly connected to. This approach makes it easy to find neighboring nodes and is memory-efficient, especially for sparse networks with few connections. It's commonly used in computer science for routing, social networks, and mapping relationships because it provides quick access to connected nodes and reduces storage needs.