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.
Currently the graph uses
forward_listcontainers 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.