For a dataset with ~1000 ligand, the graphing minimization algorithm will take long time to finish since the initial graph contains large amount of connections. It will be good to have an option to grow the graph from a least connected graph to a larger graph.
For a dataset with ~1000 ligand, the graphing minimization algorithm will take long time to finish since the initial graph contains large amount of connections. It will be good to have an option to grow the graph from a least connected graph to a larger graph.