[boost] [BGL] Multiple Start Vertices in Dijkstra Shortest Path

Subject: [boost] [BGL] Multiple Start Vertices in Dijkstra Shortest Path
From: Matthias Fuchs (mat69_at_[hidden])
Date: 2016-03-07 14:59:47

Hi folks,

I am interested in adding support for multiple start vertices for the 
Dijkstra Shortest Path Algorithm.
Having such functionality would improve both performance and clarity of 
code I wrote.

In a prove of concept I implemented such functionality using iterators 
for dijkstra_shortest_paths_no_color_map.

Is there interest for such a feature?
Or would it be a waste of my time working on that?

If there is interest what should be the preferred way?
* Using iterators (first_start_vertex, last_start_vertex)
* Using ranges

What about unit tests?
AFAICT there are only few tests, which do not seem to be run automatically.

What about documentation?

Thanks for reading,

Matthias