Definition: A graph in which the number of edges is much less than the possible number of edges. ... Typically, a sparse (connected) graph has about as many edges as vertices, and a dense graph has nearly the maximum number of edges.

Which type of representation is better for sparse graph?

Adjacency list. Good for sparse graphs and is generally preferred. Adjacency matrix.

Is a grid a graph?

Grid graphs are the class of graphs where vertices are present on the lattice points of a two-dimensional grid, and an edge can occur between a vertex and its immediate horizontal or vertical neighbor only.