(a) Draw the adjacency matrix representation for the graph of Figure 11.25.

(b) Draw the adjacency list representation for the same graph.

(c) If a pointer requires four bytes, a vertex label requires two bytes, and an edge weight requires two bytes, which representation requires more space for this graph?

(d) If a pointer requires four bytes, a vertex label requires one byte, and an edge weight requires two bytes, which representation requires more space for this graph?

Transcribed Image Text:

10 3 2 3 2 20 5 15 6 10 3 5 11