For some sparse graph an adjacency list is more space efficient against an adjacency matrix.
For some sparse graph an adjacency list is more space efficient against an adjacency matrix. Correct Answer True
Space complexity for adjacency matrix is always O(V*V) while space complexity for adjacency list in this case would be O(V).
মোঃ আরিফুল ইসলাম
Feb 20, 2025