-
-
Notifications
You must be signed in to change notification settings - Fork 39
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
GSoC 2022 : Shobhit Chaurasia Week 10 #254
GSoC 2022 : Shobhit Chaurasia Week 10 #254
Conversation
i != inv_perm.end(); ++i) { | ||
log << inv_perm[*i] << " "; | ||
auto seq=graph[*i].id; | ||
results.push_back({{seq}, {static_cast<int64_t>(inv_perm[*i])}}); |
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.
Here, the boost library uses an index map to store the nodes in results. But the problem is, I didn't know how to introduce an index map of the same type that is present in the boost library to the graph type which I followed.
@@ -88,6 +88,9 @@ class CuthillMckeeOrdering : public Pgr_messages{ | |||
std::vector <size_type> colors(boost::num_vertices(graph.graph)); | |||
auto color_map = boost::make_iterator_property_map(&colors[0], i_map, colors[0]); | |||
auto out_deg = boost::make_out_degree_map(graph.graph); | |||
#if 0 | |||
boost::property_map<Graph,boost::vertex_index_t>::const_type index_map=boost::get(boost::vertex_index, graph.graph); |
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.
It is giving me error
Changes proposed in this pull request:
@pgRouting/admins