Are you sure you're getting this? Fill in the missing part by typing it in.
Consider a problem where we have a graph with n nodes represented by an adjacency matrix.
Assuming we use a simple depth-first traversal for detecting a cycle in the graph, the space complexity will be ___.
Write the missing line below.
