Deal with partially connected graphs in anatevka #3
Description
Anatevka's dryad's termination condition assumes that the problem graph is connected. We either need to warn the user or remove this restriction.
{{ message }}
Anatevka's dryad's termination condition assumes that the problem graph is connected. We either need to warn the user or remove this restriction.