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
Currently the graph uses forward_list containers to store adjacency entries. Because of this erasing edges and vertices in a big graph is extremely slow (lists have to be iterated from the beginning to find entries to delete). Therefore a random access container might be a better choice.
The text was updated successfully, but these errors were encountered:
Currently the graph uses
forward_list
containers to store adjacency entries. Because of this erasing edges and vertices in a big graph is extremely slow (lists have to be iterated from the beginning to find entries to delete). Therefore a random access container might be a better choice.The text was updated successfully, but these errors were encountered: