##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
(Memory usage)
Space complexity for SCC algorithms is . Kosaraju: Visited array (), finish time stack (), transpose adjacency list (), and second visited array (). Total: . Tarjan: Arrays for , , (each ), stack for current path (), and adjacency list ().
Total: . Condensation graph: Worst case edges if no edges collapse (e.g., DAG with no SCCs of size ).
