Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Change adjacency list container #4

Open
w1th0utnam3 opened this issue Jun 29, 2015 · 0 comments
Open

Change adjacency list container #4

w1th0utnam3 opened this issue Jun 29, 2015 · 0 comments

Comments

@w1th0utnam3
Copy link
Owner

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.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Projects
None yet
Development

No branches or pull requests

1 participant