Edge list
From HandWiki
Short description: Graph data structure
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.[1] The entire edge list may be represented as a two-column matrix.[2][3] An edge list may be considered a variation on an adjacency list which is represented as a length [math]\displaystyle{ |V| }[/math] array of lists.[4] Since each edge contains just two or three numbers, the total space for an edge list is [math]\displaystyle{ \Theta (|E|) }[/math].[3]
References
- ↑ 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. http://dl.acm.org/citation.cfm?id=314500.314891.
- ↑ "igraph R manual pages". https://igraph.org/r/doc/graph_from_edgelist.html.
- ↑ 3.0 3.1 "Representing graphs" (in en). https://www.khanacademy.org/computing/computer-science/algorithms/graph-representation/a/representing-graphs.
- ↑ Kolaczyk, Eric D. (2009-04-20). Statistical analysis of network data : methods and models. New York. pp. 22. ISBN 9780387881461. OCLC 405547055. https://archive.org/details/statisticalanaly00kola.
 |  |
