In graph theory and computer science, an adjacency list is a collection of unordered lists used to represent a finite graph.
The above graph can be represented as the set \(S\) which contains \(\{B,C\}\), \(\{A,C\}\), \(\{B,A\}\).
| Vertices | Edges |
|---|---|
| A | B, C |
| B | A, C |
| C | A, B |
Also see Adjacency matrix.
Bibliography
“Adjacency List.” 2022. Wikipedia, April. https://en.wikipedia.org/w/index.php?title=Adjacency_list&oldid=1083389776.