Lesson plan
Edge list
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|) .
Article summary
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|) .
Key claims
No claims recorded.
Discussion questions
- Summarise the article in your own words. Which single claim would you verify first, and why?
- Which claim in this article is most likely to be revised as the sources update? How would you check its current status?
- If two sources disagreed about one of these facts, what would you need in order to trust one over the other?
Bibliography
No sources recorded.
Key claims and bibliography are generated from the same tracked claims and sources as the article page.