Edge Cases for SCC Problems

Self-loops (edges from a node to itself, like $v \to v$) do not affect SCC structure. Node $v$ is still in the same SCC with or without the self-loop. Single isolated nodes with no incoming or outgoing edges form SCCs of size $1$.

Every node belongs to exactly one SCC, even if it is alone. Make sure your SCC algorithm handles edge cases: graphs with $n = 1$, graphs with $m = 0$ (no edges), and graphs where all nodes are isolated.