Connected Graph is a graph in which there is a path between every pair of nodes.
Key Characteristics:
Operation | Time Complexity | Space Complexity |
---|---|---|
Add Node | O(1) | O(V+E) |
Add Edge | O(1) | O(1) |
Remove Node | O(V+E) | O(V+E) |
Remove Edge | O(1) | O(1) |
Is Connected? | O(V+E) | O(V+E) |
Strengths:
Limitations: