Editing Adjacency list (section)

{{short description|Data structure representing a graph}}
{{More citations needed|date=September 2023}}
[[Image:Simple cycle graph.svg|thumb|120px|This undirected cyclic graph can be described by the three unordered lists {{nowrap|{b, c}}}, {{nowrap|{a, c}}}, {{nowrap|{a, b}}}.]]

In [[graph theory]] and [[computer science]], an '''adjacency list''' is a collection of unordered lists used to represent a finite [[Graph (discrete mathematics)|graph]]. Each unordered list within an adjacency list describes the set of neighbors of a particular [[Vertex (graph theory)|vertex]] in the graph. This is one of several commonly used representations of [[Graph (abstract data type)|graphs]] for use in computer programs.