Quick Facts

Pros:

  • Time complexity of edge and vertex insertion \(O(1)\).
  • Consumes \(O(E + V)\) space.
  • Searching for edge or vertex takes \(O(1)\) time.
  • Dynamic size.

Cons:

  • Deletion of vertices takes \(O(E)\) in the worst case, when an edge has a vertex to every edge.
  • Objects not stored in continuous space in memory. Not cache friendly.

References

Leave a Reply

Come See Me

San Francisco, CA
hello@ingax.com

See My Work