Directed Graph (digraph) is a graph in which edges have a direction, going from one node to another.
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) |
Out/In-Degree | O(V) | O(1) |
Strengths:
Limitations: