STEM Interactive Visual Learning Program at TEC-Bridge AI
Disconnected Graph is a graph in which at least two vertices are not connected by a path.
Key Characteristics:
Operation | Time Complexity | Space Complexity |
---|---|---|
Add Node | O(V^2) | O(V^2) |
Add Edge | O(1) | O(1) |
Remove Node | O(V^2) | O(V^2) |
Remove Edge | O(1) | O(1) |
Is Connected? | O(V+E) | O(V) |
Component Count | O(V+E) | O(V) |
Strengths:
Limitations: