• the larger of V,E determines the complexity

Cost of operations:

• initialisation: O(V)   (initialise V lists)
• insert edge: O(1)   (insert one vertex into list)
  • if you don't check for duplicates
• find/delete edge: O(V)   (need to find vertex in list)