In an adjacency matrix for an undirected graph ,almost half the storage space required by the graph is unnecessary (the have 0 value).
please suggest a modification that uses less space

Regards
Harsh Jain