Get the non-destructive path (if any exist) that is the shortest sequence of Transitions required to migrate from startState to endState.
Get the non-destructive path (if any exist) that is the shortest sequence of Transitions required to migrate from startState to endState. NOTE: If there exists more than one shortest non-destructive path, then one of them is arbitrarily returned.
state for path to start from
state for path to end at
Some non-destructive sequence of Transitions from startState to endState, or None if there is no such path; if startState == endState then returns an empty sequence.
Get the path (if any exist) that is the shortest sequence of Transitions required to migrate from startState to endState.
Get the path (if any exist) that is the shortest sequence of Transitions required to migrate from startState to endState. NOTE: If there exists more than one shortest path, then one of them is arbitrarily returned.
state for path to start from
state for path to end at
Some sequence of Transitions from startState to endState, or None if there is no such path; if startState == endState then returns an empty sequence.
Comprises a
Setof possibleTransitions, and can find a sequence of those Transitions that constitutes a migration "path" from one state to another.Author:
Eric Evans