-
Notifications
You must be signed in to change notification settings - Fork 216
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
Feature : Resource Contrained Shortest Pahts to every vertices from source #239
base: develop
Are you sure you want to change the base?
Feature : Resource Contrained Shortest Pahts to every vertices from source #239
Conversation
std::list<typename graph_traits< Graph >::vertex_descriptor> list_vertices; | ||
// add all vertices if asked for | ||
if(b_all_pareto_optimal_solutions_on_all_vertices) | ||
BGL_FORALL_VERTICES_T(i, g, Graph) | ||
list_vertices.push_back(i); | ||
else | ||
// else only target | ||
list_vertices.push_back(t); |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Not satisfied with those lines but could not find a better way to implement this without impacting performance (very slightly) for the old usage.
// Copyright Michael Drexl 2005, 2006. | ||
// Distributed under the Boost Software License, Version 1.0. | ||
// (See accompanying file LICENSE_1_0.txt or copy at | ||
// http://boost.org/LICENSE_1_0.txt) |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Copyright should be to be changed as the test is from me but I did not know the exact procedure for this.
builds seem to timeout on windows for mscv for unknown reason? |
See #238
Closes #238
If formatting or anything is to be changed let me know.