Question: Create an algorithm to efficiently detect cycles in a directed graph. Optimize for both time and space complexity, and consider scenarios where the graph is large and memory-efficient solutions are crucial.