Resource Contrained Shortest Pahts to every vertices from source : r_c_shortest_paths_to_n

Hello everyone bare with me if this has no place here but I have a requirement for a professional project to find every best feasible path to every vertex in a graph. My research did not provide me any way to do it but I may have missed something. If so tell me and I will gladly use it and get rid of my useless code.

It appears that r_c_shortest_paths does that already but does not provide an api to get the solution for all vertices.

Right now r_c_shortest_paths extends all feasible labels and then pick the best ones for the vertex identified as the 'target'. What i want is to get the best labels on every vertices.

I have already created a r_c_shortest_paths_to_n (took very little time but only a few unitary tests have been added yet) for my project but would like to offer a boost extension for such feature.

Start by locating the existing r_c_shortest_paths entry point and reviewing the issue author's r_c_shortest_paths_to_n implementation. Then inspect the few unitary tests already added. Done means the all-vertices behavior is exposed consistently and covered by sufficient tests.

Written by the indexing model from the issue text.