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

Feature : Resource Contrained Shortest Pahts to every vertices from source #239

Open
wants to merge 5 commits into
base: develop
Choose a base branch
from

Conversation

SimonPiCarter
Copy link

See #238

Closes #238

If formatting or anything is to be changed let me know.

Comment on lines +437 to +444
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);
Copy link
Author

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.

Comment on lines +1 to +4
// 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)
Copy link
Author

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.

@SimonPiCarter
Copy link
Author

builds seem to timeout on windows for mscv for unknown reason?

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

Successfully merging this pull request may close these issues.

Resource Contrained Shortest Pahts to every vertices from source : r_c_shortest_paths_to_n
2 participants