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:
“Hey, you dress up our town very nicely. You don’t look out the Chamber of Commerce is going to list you in their publicity with the local attractions.”
—Robert M. Fresco, and Jack Arnold. Dr. Matt Hastings (John Agar)
Related Subjects
Related Phrases
Related Words