Source: wikibot/reachability-problem
= Reachability problem
{wiki=Reachability_problem}
The Reachability problem is a fundamental question in the field of computer science, particularly in the study of graph theory and formal languages. It addresses the problem of determining whether there exists a path from one node (or state) to another node in a graph or a state in an automaton.