Which graph representation uses space efficient for sparse graphs while…

Bihar STET · PGT (Paper 2) · Computer Science · 2024

Which graph representation uses space efficient for sparse graphs while supporting efficient iteration over the neighbors of a given vertex?

  1. A.

    Adjacency matrix

  2. B.

    Adjacency list

  3. C.

    Edge list

  4. D.

    Incidence matrix

Attempted by 20 students.

Show answer

Correct answer: B

The worked solution is available to enrolled students.

Explore the full course: Bihar Stet Paper Ii Computer Science

Loading lesson…