Anatevka's dryad's termination condition assumes that the problem graph is connected. We either need to warn the user or remove this restriction.
Anatevka's dryad's termination condition assumes that the problem graph is connected. We either need to warn the user or remove this restriction.