Adjacency list
Data structure representing a graph
Adjacency list
In graph theory and computer science, an adjacency list is a collection of unordered lists used to represent a finite graph. Each unordered list within an adjacency list describes the set of neighbours of a particular vertex in the graph. This is one of several commonly used representations of graphs for use in computer programs.
Read on Wikipedia · Image Booyabazooka at English Wikipedia, Public domain
Open boosters, collect cards and trade them. Free to play.
Play for free