Which of the following graph representations is most efficient for a sparse…

TPSC Computer/IT Posts 2026

Which of the following graph representations is most efficient for a sparse graph with V vertices and E edges where E<<V2E << V^2 ?

  1. A.

    Adjacency matrix

  2. B.

    Adjacency list

  3. C.

    Incidence matrix

  4. D.

    Edge list

Attempted by 47 students.

Sign up free to check your answer

Sign up free

Explore the full course: Gate Guidance By Sanchit Sir

Loading lesson…