For this reason, a DOP can be reformulated as the problem of finding a minimum-cost path in a graph from a designated initial node to one of several possible goal nodes.
Each element x in S can be viewed as a path from the initial node to one of the goal nodes.