Configuration graphs are a theoretical tool used in computational complexity theory to prove a relation between graph reachability and complexity classes.[citation needed]