␥ g r a p h s ␥

a graph is a data structure that is mathematically defined as an ordered pair of a vertex set and an edge set
however in the context of cs and the application of storing this data structure in memory, specific implementations are required

the two most common ways to implement graphs are as adjacency matrices or as adjacency lists, both with their pros and cons the adjacency list is perfect for sparse graphs (where one node is connected to a very small proportion of all nodes) as the adjacency matrix would be big and mainly empty

adjacency list