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
I was wondering, is it possible to ensure that PGGB will produce a graph that has only a single connected component? Alternatively, which parameters can I pass to make it more likely that the resulting graph will have a single connected component?
The text was updated successfully, but these errors were encountered:
You can try reducing -s, -l, and -p parameters in order to get more mappings that would keep everything in a single connected component. However, be aware that the alignment will become much slower, and also the next steps.
Hello,
I was wondering, is it possible to ensure that PGGB will produce a graph that has only a single connected component? Alternatively, which parameters can I pass to make it more likely that the resulting graph will have a single connected component?
The text was updated successfully, but these errors were encountered: