Find a shortest path connecting two teams (if one exists).
Optionally specify that the directed path should form a chain of wins or losses.
Leave the loser blank to find a path with greatest ranking ascent / descent.