Both adjacency list and adjacency matrix structures extend the edge list structu

Question

Both adjacency list and adjacency matrix structures extend the edge list structure with additional information. Drag and drop the appropriate structure into extra information below. includes a reference to a collection I(v) in the vertex object v. The collection I(v) is called the incidence collection of v, whose elements store references to the edge incident on v. includes references to the positions or entries associated with edge e in the incident collections I(v) and I(w) in the edge object for an edge e with end vertices v and w. includes a distinct integer in the range 0, 1, ..., n - 1 (the index of v) in the vertex object v. keeps a two-dimensional n times n array A such that the cell A[i, j] holds a reference to the edge (v, w), if it exists, where v is the vertex with index i and w is the vertex with the index j. If there is no such edge, then A[i, j] = null. The performance of the adjacency list structure is superior than that of the adjacency matrix structure in space and in time for all functions except for the function.

Explanation / Answer

1)

Adjacency List Structure

Adjacency Matrix Structure

Adjacency List Structure

Adjacency Matrix Structure

2)

eraseEdge

Related Questions

Navigate

• Browse (All)
• Browse B
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.