[EM] Question about Schulze beatpath method

[Markus Schulze]

Hallo,

it can happen that the weakest link in the strongest path
from candidate A to candidate B and the weakest link in the
strongest path from candidate B to candidate A is the same link,
say CD.

I recommend that, in this case, the link CD should be declared
"forbidden" and the strongest path from candidate A to candidate B
and the strongest path from candidate B to candidate A, that does
not contain a "forbidden" link, should be calculated. If again the
weakest link in the strongest path from candidate A to candidate B
and the weakest link in the strongest path from candidate B to
candidate A is the same link (say EF), then also this link should
be declared "forbidden" and the paths from A to B and from B to A
should be calculated. This should be repeated until the weakest
link in the strongest path from A to B and the weakest link in the
strongest path from B to A are different links.

Markus Schulze