In graph theory, an adjacency list is the representation of all edges or arcs in a graph as a list.
If the graph is undirected, every entry is a set (or multiset) of two nodes containing the two ends of the corresponding edge; if it is directed, every entry is a tuple of two nodes, one denoting the source node and the other denoting the destination node of the corresponding arc.
Typically, adjacency lists are unordered.
Read more about Adjacency List: Application in Computer Science, Trade-offs
Famous quotes containing the word list:
“Religious literature has eminent examples, and if we run over our private list of poets, critics, philanthropists and philosophers, we shall find them infected with this dropsy and elephantiasis, which we ought to have tapped.”
—Ralph Waldo Emerson (1803–1882)