You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
We need tests that double check cut results. In particular, tests should check (1) whether a cut is indeed an incorrect cut (i.e. after removing the proposed edges/vertices in the cut/separators, we should double check the connectivity); and (2) for minimal cuts, we should check whether they are indeed minimal.
In particular, the graphs listed in #2532 could be tested for cuts, while the graphs listed in #2521 could be used for separators.
One could use igraph_distances to check whether there is a path still between two specific nodes. So, the core of the test could be something like the following for cuts (and something similar for separators).
One you've passed those first hurdles, try to see if you can create a small program according to the specifications above. Once you've got something running, it would be good to open a (draf) PR. Once it all works as expected we can integrate it properly into igraph as a test, I'll help you on your way there.
We need tests that double check cut results. In particular, tests should check (1) whether a cut is indeed an incorrect cut (i.e. after removing the proposed edges/vertices in the cut/separators, we should double check the connectivity); and (2) for minimal cuts, we should check whether they are indeed minimal.
In particular, the graphs listed in #2532 could be tested for cuts, while the graphs listed in #2521 could be used for separators.
One could use
igraph_distances
to check whether there is a path still between two specific nodes. So, the core of the test could be something like the following for cuts (and something similar for separators).The text was updated successfully, but these errors were encountered: