What are the differences between an edge list and an adjacency list in graph theory?

In graph theory, an edge list is a simple list that shows the connections between nodes in a graph by listing the pairs of nodes that are connected by an edge. An adjacency list, on the other hand, is a more structured representation that lists each node and its neighboring nodes. The main difference is that an edge list focuses on the edges themselves, while an adjacency list focuses on the nodes and their connections.