This assumption states that if the optimal path through a graph happens to go through state q, then this optimal path must include the best path up to and including q.
once an optimal path to state q is found, all other paths to q can be eliminated from the search.