Open rlratzel opened 3 years ago
The new graph object construction code can handle this properly as long as the python code calls the construction properly.
The legacy graph object construction code in C++ should handle this properly except in the case where there are isolated vertices at the end of the vertex list.
We need to prioritize/schedule this accordingly. If we can wait until we migrate to the new graph objects (C++) then this problem will be corrected at that point. If we need to fix it sooner then we will need to update the legacy implementation to properly handle isolated vertices at the end of the vertex list.
This issue has been labeled inactive-30d
due to no recent activity in the past 30 days. Please close this issue if no further response or action is needed. Otherwise, please respond with a comment indicating any updates or changes to the original issue and/or confirm this issue still needs to be addressed. This issue will be labeled inactive-90d
if there is no activity in the next 60 days.
This issue has been labeled inactive-30d
due to no recent activity in the past 30 days. Please close this issue if no further response or action is needed. Otherwise, please respond with a comment indicating any updates or changes to the original issue and/or confirm this issue still needs to be addressed. This issue will be labeled inactive-90d
if there is no activity in the next 60 days.
Note that #3982 adds parameters to the C API that can address this. The python layer would need to be updated to pick up these changes in the case of an adjacency matrix.
Isolated vertices are lost when we initialize a Graph using an adj list:
This is likely due to internally converting the numpy array to an edgelist, which is then used to initialize the Graph. We may be able to at least capture the correct number of vertices by looking at the incoming array's shape (which would also allow us to assert it's square).