Approach 1: DFS
- Time:O(|V| + |E|), where |V| = n and |E| = |\texttt{relations}|
- Space:O(|V| + |E|), where |V| = n and |E| = |\texttt{relations}|
C++ |
---|
|
JAVA |
---|
|
Python |
---|
|
Approach 2: Topology
- Time:O(|V| + |E|)
- Space:O(|V| + |E|)
C++ |
---|
|
JAVA |
---|
|
Python |
---|
|