An edge list is a data structure used to represent a graph as a list of its edges. An (unweighted) edge is defined by its start and end vertex, so each edge may be represented by two numbers. The entire edge list may be represented as a two-column matrix. An edge list may be considered a variation on an adjacency list which is represented as a length array of lists. Since each edge contains just two or three numbers, the total space for an edge list is .
- Munagala, Kameshwar; Ranade, Abhiram (1999). "I/O-complexity of Graph Algorithms". Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms. SODA '99. Philadelphia, PA, USA: Society for Industrial and Applied Mathematics: 687–694. ISBN 9780898714340.
- "igraph R manual pages". igraph.org. Retrieved 2019-10-16.
- "Representing graphs". Khan Academy. Retrieved 2019-10-16.
- Kolaczyk, Eric D. (2009-04-20). Statistical analysis of network data : methods and models. New York. p. 22. ISBN 9780387881461. OCLC 405547055.