Some terminology:

• Suppose G = (V,E) and for some u, v ∈ V, (u,v) ∈ E
• Then u is adjacent to v in G.

There are two main methods of graph representation:

• Adjacency List method
  • Best for sparse graphs
• Adjacency Matrix method
  • Best for dense graphs