Currently we use all available edge lists to find components in the downloaded graph. In the future we might want to provide the option to check each edge lists individually for islands. This is not trivial because it breaks the assumptions of the post-processing step that cleans orphan vertices.
Currently we use all available edge lists to find components in the downloaded graph. In the future we might want to provide the option to check each edge lists individually for islands. This is not trivial because it breaks the assumptions of the post-processing step that cleans orphan vertices.