Undirected Graph is a graph where edges have no direction. Each edge simply connects two nodes, and the connection is bidirectional.
Key Characteristics:
Strengths:
Limitations:
| Operation | Time Complexity | Space Complexity |
|---|---|---|
| Add Node | O(1) | O(V+E) |
| Add Edge | O(1) | O(1) |
| Remove Node | O(E) | O(V+E) |
| Remove Edge | O(E) | O(1) |
| Edge Count | O(1) | O(1) |