# Log space reduction from STCONN to CYCLE

I read this post: Showing Cycle is NL-complete?, but I am not sure why the reduction is log space, as it requires keeping track of the new graph, which has $$n^2$$ nodes.

• The new graph has $O(n^2)$ nodes. – Yuval Filmus May 21 at 20:36
• Thank you for correction. However, I am still not sure why it is a log space reduction. – Quin Morris May 21 at 20:37