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.

Sign up for GitHub

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

Jump to bottom

Mention the complexity of an operation #30

Open

richelbilderbeek opened this issue Dec 29, 2015 · 0 comments

Owner

richelbilderbeek commented Dec 29, 2015

Here is the thread:

https://www.reddit.com/r/cpp/comments/3xw5q0/a_wellconnected_c11_boostgraph_tutorial/

From mat69:

You should also mention the complexity of operations. The way you retrieve a vertex by name is O(n). I guess in most use cases it will be more efficient to have an std::unordered_map<std::string, MyVertex> and doing a lookup instead.

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