Edge list

Uses your system voice; voice and rate in settings.

Snapshot

≈ 1 min read

Names in other languages

No names in other languages are held for this entry yet.

Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.

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 |V| array of lists. Since each edge contains just two or three numbers, the total space for an edge list is \Theta (|E|) .

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 |V| array of lists. Since each edge contains just two or three numbers, the total space for an edge list is \Theta (|E|) .

Text derived from https://en.wikipedia.org/w/index.php?oldid=999127466 under CC BY-SA 4.0; modifications have been made.

Sources cited in this revision

Extracted from the cited revision's reference blocks; absent citations are not invented.